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.
1、给出的参数是不能修改的字符指针,所以不能用size()和length()。
2、又忘了把计数量i的值操作,第一次运行超时了
3、感觉这是最简单的题了吧
class Solution {
public:
int lengthOfLastWord(const char *s) {
int i,num=0;
if(s[0]=='\0')
return 0;
for(i=0;s[i]!='\0';i++){}
i--;
while(s[i]==' ')
i--;
while(i>=0)
{
if(s[i]!=' ')
num++;
else
break;
i--;
}
return num;
}
};