题目描述:
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
.
思路分析:
题目要求求出一个字符串中最后一个单词的长度,首先得对字符串的长度进行判断,如果字符串为空串,那么应该return 0;否则就应该返回最后一个单词的长度。那么怎么找出最后一个单词呢?其实很简单,只要计算从该字符串的倒数第一个非空字符到空字符之间的长度即可。
代码:
class Solution {
public:
int lengthOfLastWord(string s) {
if(s.size()==0)
return 0;
else
{
int count=0;
int i;
for(i=s.size()-1;i>=0;i--)
{
if(s[i]!=' ')
break;
}
while(s[i]!=' '&&i>=0)
{
i--;
count++;
}
return count;
}
}
public:
int lengthOfLastWord(string s) {
if(s.size()==0)
return 0;
else
{
int count=0;
int i;
for(i=s.size()-1;i>=0;i--)
{
if(s[i]!=' ')
break;
}
while(s[i]!=' '&&i>=0)
{
i--;
count++;
}
return count;
}
}
};