Length of Last Word
Given a string s consists ofupper/lower-case alphabets and empty space characters ' ', return the length oflast word in the string.
If the last word does not exist, return 0.
Note: A word is defined as a charactersequence consists of non-space characters only.
For example,
Given s = "Hello World",
return 5.
看起来不是很难,其实确实如此,我就直接在leetcode网页上写了。填一些坑就完事了。
两个坑,第一它允许尾空格,我们要忽略它。第二就是结束判断。
Leetcode的AcceptedSolutions Runtime Distribution(崩溃,58跟66的图一样,重新截——15-06-26)
源码:
int lengthOfLastWord(string s){
string::iterator iter = s.end();
int len = 0;
bool start = false;
while (s.begin() != iter)
{
iter--;
if (' ' != *iter)
{
start = true;
}
if (start)
{
if (' ' != *iter) len++;
else return len;
}
}
return len;
}