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
.
题意
一个字符串里最后一个单词的长度
题解
遍历字符串,计算每个单词的长度,返回最后一个单词长度就行。注意细节即可
class Solution {
public:
int lengthOfLastWord(string s) {
if(s.size()==0)
return 0;
int n=0;
int cur_n=0;
for(int i=0;i!=s.size();i++)
{
if(s[i]!=' ')
cur_n++;
else
{
if(cur_n!=0)
n=cur_n;
cur_n=0;
}
}
if(cur_n!=0)
n=cur_n;
return n;
}
};