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) {
if(s.empty()) return 0;
int n=s.length(),i,ans=0;
n--;
while(s[n]==' '&&n>=0)n--;
for(i=n;i>=0;i--){
if(s[i]!=' ') ans++;
else break;
}
return ans;
}
};版权声明:本文为博主原创文章,未经博主允许不得转载。
leetcode-58-Length of Last Word
原文:http://blog.csdn.net/u014705854/article/details/46836101