[leetcode 58] Length of Last Word

最新推荐文章于 2025-12-31 20:36:24 发布

原创最新推荐文章于 2025-12-31 20:36:24 发布 · 239 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #String

[LeetCode 刷题] 专栏收录该内容

158 篇文章

订阅专栏

本文介绍了一种算法，用于计算给定字符串中最后一个单词的长度。该算法通过遍历字符串并忽略空格来实现这一目标。

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) {
        const int n = strlen(s);
        int res = 0;
        int ind = n - 1;
        while (ind >= 0 && *(s+ind) == ' ') {
            ind--;
        }
        while (ind >= 0 && *(s+ind) != ' ') {
            ind--;
            res++;
        }
        return res;
    }
};