58. 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.

Example:
Input: "Hello World"
Output: 5

难度:easy

题目:

给定字符串包含大小写字母和空格,返回最后一个单词的长度。

如果最后一个单词不存在,则返回0.

Runtime: 3 ms, faster than 62.11% of Java online submissions for Length of Last Word.

Memory Usage: 21.5 MB, less than 96.23% of Java online submissions for Length of Last Word.

public class Solution {
    public int lengthOfLastWord(String s) {
        if (null == s || s.trim().isEmpty()) {
            return 0;
        }
        s = s.trim();
        int wordLength = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            if (s.charAt(i) == ' ') {
                return wordLength;
            } else {
                wordLength++;
            }
        }
        
        return wordLength;
    }
}

原文 

https://segmentfault.com/a/1190000018097986

本站部分文章源于互联网,本着传播知识、有益学习和研究的目的进行的转载,为网友免费提供。如有著作权人或出版方提出异议,本站将立即删除。如果您对文章转载有任何疑问请告之我们,以便我们及时纠正。

PS:推荐一个微信公众号: askHarries 或者qq群:474807195,里面会分享一些资深架构师录制的视频录像:有Spring,MyBatis,Netty源码分析,高并发、高性能、分布式、微服务架构的原理,JVM性能优化这些成为架构师必备的知识体系。还能领取免费的学习资源,目前受益良多

转载请注明原文出处:Harries Blog™ » 58. Length of Last Word

赞 (0)
分享到:更多 ()

评论 0

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址