Description
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.
Solution
统计最后一个单词的长度,简单的统计,遇见空格就重新统计。有一点要注意的是,当字符串末尾有空格时,需要保留上一次的长度统计。
class Solution {
public:
int lengthOfLastWord(string s) {
int len=0;
bool flag=true;
for(int i=0;i<s.size();i++){
if(!isspace(s[i])){
if(!flag) len=0;//通过标记位的形式,如果在遇见非空格字符,才清除上次记录。
flag=true;
len++;
}else{
flag=false;
}
}
return len;
}
};