原题:
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
.
代码如下: (C)
int lengthOfLastWord(char* s) {
if(s==NULL)
return 0;
int length=strlen(s);
if(length==0)
return 0;
int result=0;
int flag=0;
for(int n=length-1;n>=0;n--)
{
if(*(s+n)!=' ')
{
flag=1;
result++;
}
if(*(s+n)==' '&&flag==1)
{
return result;
}
}
return result;
}
唉最近被动态规划虐的有点蛋疼。。。,心情糟糕,感觉需要补一补数学知识了。。。
都是3ms。