Leetcode题解15 58. Length of Last Word

最新推荐文章于 2021-09-29 15:23:53 发布

Xd_Yu

最新推荐文章于 2021-09-29 15:23:53 发布

阅读量257

点赞数

分类专栏： Leetcode题解文章标签： leetcode

本文链接：https://blog.csdn.net/Xd_Yu/article/details/51176091

版权

Leetcode题解专栏收录该内容

80 篇文章 0 订阅

订阅专栏

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

最后要加判断，把字符串尾部的空格过滤掉。

public static int lengthOfLastWord(String s) {
        boolean isLast = true;
        StringBuilder sb = new StringBuilder();
        for (int i = s.length() - 1; i >= 0; i--) {
            if (isLast && s.charAt(i) == ' ') {
                continue;
            }
            if (s.charAt(i) != ' ') {
                sb.append(s.charAt(i));
                isLast = false;
                continue;
            }
            break;
        }
        return sb.length();
    }