1. 题目
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.
2. 思路
无聊的题目
3. 代码
class Solution {
public:
int lengthOfLastWord(string s) {
int cnt = 0;
int i = s.length() - 1;
while (i>= 0 && s[i] == ' ') i--;
while (i >= 0 && s[i] != ' ') {
cnt++;
i--;
}
return cnt;
}
};
**粗体** _斜体_ [链接](http://example.com) `代码` - 列表 > 引用
。你还可以使用@
来通知其他用户。