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
既然是找最后一个单词的从字符串的结尾开始寻找。
class Solution {
public:
int lengthOfLastWord(string s) {
if(s.length() == 0)
return 0;
int cnt = 0;
int leg = s.length();
int i = leg-1;
while(s[i]==' '){
i--;
}
while(i>=0){
if(s[i]!=' '){
cnt++;
i--;
}else
break;
}
return cnt;
}
};