问题描述:
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.
示例:Given s = "Hello World"
,
return 5
.
问题分析:
题目要求求一个字符串最后一个单词的长度,我们只需要遍历每一个单词,每次都存好最后一个单词的长度返回即可。
以下是我的详细代码:
class Solution {
public:
int lengthOfLastWord(string s) {
int len = 0;
int last = 0;
for(int i = 0; i < s.length(); i++)
{
if(s[i] != ' ')
{
len++;
last = len;
}
else len = 0;
}
return last;
}
};
是不是很简单呀~~