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(const char *s) {
}
};
这里要特别注意 "a "的情况,因此一定要判断当前字符,以及下一个字符的状态,两个联系在一起进行判断
class Solution {
public:
int lengthOfLastWord(const char *s) {
int index=0;
while (*s!='\0')
{
if (*s!=' ')
index++;
else if (*(s+1)!='\0'&&*(s+1)!=' ')
{
index=0;
}
s++;
}
return index;
}
};