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
要注意 "a " 这样也算一个单词
class Solution {
public:
int lengthOfLastWord(string s) {
int len=s.length(),i,cnt=0;
while(len&&s[len-1]==' '){
len--;
}
for(i=len-1;i>=0&&s[i]!=' ';i--){
cnt++;
}
return cnt;
}
};