原题:
解决方法:
先跳过尾部的空格,然后从后往前,直到找到第一个空格。
代码:
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.
Example:
Input: "Hello World" Output: 5
解决方法:
先跳过尾部的空格,然后从后往前,直到找到第一个空格。
代码:
int lengthOfLastWord(string s) {
int res = 0, end = s.size() -1;
while(end >= 0 && s[end] == ' ')
--end;
while(end >=0 && s[end] != ' '){
++res;
--end;
}
return res;
}