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 i,result=0;
int len = s.length();
if(len==0)
return 0;
for(i=len-1; i>=0;i--)
{
if(s[i]!=' ')
break;
}
while(s[i]!=' '&&i>=0)
{
result++;
i--;
}
return result;
}
};