[LeetCode] Length of Last Word

最新推荐文章于 2019-06-20 10:49:28 发布

weixin_34319374

最新推荐文章于 2019-06-20 10:49:28 发布

阅读量60

点赞数

本文介绍了一种计算给定字符串中最后一个单词长度的方法。通过遍历字符串并利用条件判断更新长度变量，实现了对最后一个单词长度的有效计算。若字符串末尾不存在单词，则返回0。

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.

Hide Tags

String

思路：遇到空格并且下一个字符不是空格或者‘\0’ ,len 清零，否则++；

class Solution {
    public:
        int lengthOfLastWord(const char *s)
        {
            const char *p = s;
            int len = 0;

            p = s;
            while(*p != '\0')
            {
                if(*p == ' ')
                {
                    if(*(p+1) != ' ' && *(p+1) != '\0')
                        len = 0;
                }
                else
                    len ++;
                p++;
            }

            return len;
        }
};