[leetcode] Length of Last Word

原创于 2015-06-03 03:45:58 发布 · 332 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一个LeetCode上的编程题目，即求字符串中最后一个单词的长度。通过C++实现了解决方案，从字符串末尾开始遍历，统计非空字符的数量以确定最后一个单词的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

From : https://leetcode.com/problems/length-of-last-word/

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(string s) {
        int index = s.length()-1, sum = 0;
        while(index >= 0) {
            char c = s[index];
            while(c>='a'&& c<='z' || c>='A'&&c<='Z') {
                sum++;
                if(--index>=0) c = s[index];
                else break;
            }
            if(sum) break;
            index--;
        }
        return sum;
    }
};