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.
Subscribe to see which companies asked this question
class Solution {
public:
int lengthOfLastWord(string s) {
if(s == "") return 0;
int len = s.length();
int sum = 0, cnt = 0;
for(int i = 0; i < len; i++) {
if(s[i] == ' ') {
if(cnt > 0) sum = cnt;
cnt = 0;
} else {
cnt++;
}
}
if(cnt > 0) sum = cnt;
return sum;
}
};
1052

被折叠的 条评论
为什么被折叠?



