58. Length of Last Word

林下溪源

于 2020-08-03 17:22:25 发布

阅读量228

点赞数

分类专栏： Java LeetCode 文章标签：算法 leetcode

本文链接：https://blog.csdn.net/zzyy17/article/details/107769275

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Java

44 篇文章 0 订阅

订阅专栏

Problem Description:

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word (last word means the last appearing word if we loop from left to right) in the string.

If the last word does not exist, return 0.

Note: A word is defined as a maximal substring consisting of non-space characters only.

Example:
Input: "Hello World"
Output: 5

Code:

class Solution {
    public int lengthOfLastWord(String s) {
        String[] splitWords = s.split(" ");
        int len = splitWords.length;
        if(len > 0) {
            return splitWords[len - 1].length();
        }
        return 0;
    }
}