LeetCode Length of Last Word

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

原创最新推荐文章于 2019-06-20 10:49:28 发布 · 252 阅读

0 ·

CC 4.0 BY-SA版权

面试题专栏收录该内容

144 篇文章

订阅专栏

本文介绍了一个C++方法，用于找出并返回给定字符串中最后一个单词的长度。该方法首先移除字符串尾部的空格，然后计算最后一个非空格字符序列的长度。

题目：

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(const char *s) {
        int i = 0;
        string res;
        while(s[i] != '\0') {
            while(s[i] != '\0' && s[i] == ' ') {
                i++;
            }
            if(s[i] == '\0')
                break;
            res.clear();
            while(s[i] != '\0' && s[i] != ' ') {
                res +=s[i];
                i++;
            }
            if(s[i] == '\0')
                break;
        }
        return res.size();
    }
};