首页 > 代码库 > [Leetcode] Length of Last Word
[Leetcode] 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.
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 }
[Leetcode] Length of Last Word
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。