[Leetcode] Length of Last Word

最新推荐文章于 2025-09-06 09:33:29 发布

转载最新推荐文章于 2025-09-06 09:33:29 发布 · 41 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Phoebe815/p/4051929.html

文章标签：

#java

本文介绍如何在Java中使用split函数获取字符串中最后一个单词的长度，包括两个解决方案，适用于处理包含空格字符的字符串。

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.

Solution:

关于java中的split函数：http://shukuiyan.iteye.com/blog/1058672

 1 public class Solution {
 2     public int lengthOfLastWord(String s) {
 3        if(s==null||s.length()==0)
 4             return 0;
 5         String[] ss=s.split(" ");
 6         if(ss.length==0)
 7             return 0;
 8         return ss[ss.length-1].length();
 9     }
10 }

1 public class Solution {
2     public int lengthOfLastWord(String s) {
3        if(s==null||s.trim().length()==0)
4             return 0;
5         String[] ss=s.split(" ");
6         return ss[ss.length-1].length();
7     }
8 }