LeetCode——Length of Last Word

最新推荐文章于 2025-12-06 07:43:37 发布

原创最新推荐文章于 2025-12-06 07:43:37 发布 · 729 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Online Judge 专栏收录该内容

134 篇文章

订阅专栏

本文介绍了一个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.

» Solve this problem

class Solution {
public:
    int lengthOfLastWord(const char *s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int count = 0, last = 0;
        while (*s != '\0') {
            count = *s == ' ' ? 0 : count + 1;
            last = count > 0 ? count : last;
            s++;
        }
        return last;
    }
};