首页 > 代码库 > leetcode 58
leetcode 58
58. Length of Last Word
Given a string s consists of upper/lower-case alphabets and empty space characters ‘ ‘
, return the length of last word in the string.
If the last word does not exist, return 0.
Note: A word is defined as a character sequence consists of non-space characters only.
For example,
Given s = "Hello World"
,
return 5
.
这道题比较简单,注意考虑字符串最后的空格以及全为空格的字符串的这几种特殊情况。
代码如下:
1 class Solution { 2 public: 3 int lengthOfLastWord(string s) { 4 if(s.length() == 0) 5 { 6 return 0; 7 } 8 int n = 0; 9 int l = s.length();10 for(int i = l-1; i >= 0; i--)11 {12 if(n == 0 && s[i] == ‘ ‘)13 {14 continue;15 }16 if(s[i] != ‘ ‘)17 {18 n ++;19 }20 else21 {22 break;23 }24 }25 return n;26 }27 };
leetcode 58
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。