难度:Easy
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;
for(int i=s.length()-1;i>=0;i--)
{
if(s[i] == ' ' && len ) break;
else if(s[i] !=' ') len++;
}
return len;
}
};
执行用时 :4 ms, 在所有 C++ 提交中击败了86.57%的用户
内存消耗 :8.7 MB, 在所有 C++ 提交中击败了82.08%的用户