问题描述
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.
代码
class Solution {
public:
int lengthOfLastWord(string s) {
int count=0;
int lastWordCount = count;
for(int i=0;i<s.length();i++) {
if(s[i]==' ') {
count=0;
} else if(s[i]!=' '){
count++;
lastWordCount = count;
}
}
return lastWordCount;
}
};