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
分析:
返回最后一个单词的长度,这里单词的定义是不含空格的字母即可。依次遍历字符串,如果遇到非空格的字符,判断其前面一个位置的字符是否为空格,如果是的话,将计数器重置为1,否则说明正在统计一个词的长度,计数器自增1即可。当i=0的时候,无法访问前一个字符,计数器自增1即可。
class Solution {
public:
int lengthOfLastWord(string s) {
int res = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] != ' ') {
if (i != 0 && s[i-1] == ' ') res = 1;
else res++;
}
}
return res;
}
};