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
.
按顺序遍历整个字符串,定义count和last两个变量。
count记录当前单词长度,last持续更新当前单词长度,这样可以避免遇到最后一个字符为‘ ’的情况。代码如下:
class Solution {
public:
int lengthOfLastWord(const char *s) {
int count=0,last=0;
while(*s!='\0') {
count=*s ==' '?0:count+1;
last=count>0?count:last;
s++;
}
return last;
}
};