题目

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.

分析

给出一个字符串，返回最后一个单词的长度。依次计算单词的长度，需要注意需要保存上个单词的长度，防止出现的一连串的空格导致结果的丢失。

/*
测试数据：
"   ff   "
" "
"Hello World"
*/
int lengthOfLastWord(char* s) {
    int ans=0,lastans=0,length=0;
    while(s[length]!='\0')
    {
        if(s[length]==' ')
        {
            if(ans!=0)lastans=ans;
            ans=0;
        }
        else
            ans++;
        length++;
    }
    if(ans!=0)
        return ans;
    else
        return lastans;
}