LEETCODE: Length of Last Word

最新推荐文章于 2025-12-05 14:37:41 发布

原创最新推荐文章于 2025-12-05 14:37:41 发布 · 221 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LEETCODE #算法 #string

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一个简单的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 length = strlen(s);
        int ii = length - 1;
        while(ii >= 0) {
            if(*(s + ii) == ' ')
                ii --;
            else
                break;
        }
        
        int lastlength = 0;
        while(ii >= 0) {
            if(*(s + ii) != ' ') {
                lastlength ++;
                ii --;
            }
            else
                break;
        }
        
        return lastlength;
    }
};