题目:
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
.
Subscribe to see which companies asked this question
题意:一个字符串,返回最后一个单词的长度,每个单词之间均有一个' '。
理解:这题比较简单,直接从字符串的从后往前遍历遇到第一个' '返回长度就可以了,注意边界情况
class Solution {
public:
int lengthOfLastWord(string s)
{
int length = 0;
for(int i =s.length()-1;i>=0;i--){ //从后往前遍历
if(length ==0)
if(s[i] == ' ')
continue;
else
length++;
else
if(s[i] == ' ')
break;
else
length++;
}
return length;
}
};