第40题 Length of Last Word
2015-01-17 15:28
232 查看
Given a string s consists of upper/lower-case alphabets and empty space characters
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 =
return
Hide Tags
String
Code in Java:
Note:
按一个或多个字符分割字符串:str.split("\\s+")
' ', 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.
Hide Tags
String
Code in Java:
public class Solution { public int lengthOfLastWord(String s) { if(s.length()==0) return 0; String[] words=s.split("\\s+"); if(words.length>0) return words[words.length-1].length(); else return 0; } }
Note:
按一个或多个字符分割字符串:str.split("\\s+")
相关文章推荐
- LeetCode | Length of Last Word
- leetcode Length of Last Word
- [LeetCode]Length of Last Word@python
- LeetCode #58 Length of Last Word
- [LeetCode-58] Length of Last Word(最后一个单词长度)
- LeetCode: Length of Last Word
- leetcode: length of last word
- [LeetCode]Length of Last Word
- leetcode Length of Last Word
- [Leetcode] Length of Last Word
- [LeetCode] Length of Last Word
- Length of Last Word
- Length of Last Word
- lengthOfLastWord
- Length of Last Word
- Leetcode58 Length of Last Word
- leetcode解题方案--058--Length of Last Word
- Length of Last Word
- LeetCode-Length of Last Word
- leetcode——58——Length of Last Word