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