leetcode---Length of Last Word---字符串

最新推荐文章于 2024-05-06 22:53:40 发布

原创最新推荐文章于 2024-05-06 22:53:40 发布 · 248 阅读

0 ·

CC 4.0 BY-SA版权

题专栏收录该内容

456 篇文章

订阅专栏

本文介绍了一种计算给定字符串中最后一个单词长度的方法。通过反转字符串并遍历字符来实现，只考虑字母字符，忽略空格。适用于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(string s) {
        int len = s.length();
        if(len == 0)
            return 0;
        reverse(s.begin(), s.end());
        int count = 0;
        int i = 0;
        while(i<len && !isalpha(s[i]))
            i++;
        for(; i<len; i++)
            if(isalpha(s[i]))
                count++;
            else
                return count;
        return count;
    }
};