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) {
int len=0;
int tail=s.size()-1; //starts from tail
while(tail>=0 && s[tail]==' ')
{
tail--;
}
while(tail>=0 && s[tail]!=' ')
{
len++;
tail--;
}
return len;
}
};