标签：
1题目
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.
2 思路
这题比较简单，看完题目就能想到思路，代码里有解析。
3 代码
public int lengthOfLastWord(String s) { s = s.trim(); if (s.isEmpty()) { return 0; } String lastWord = ""; int lastBlankIndex = s.lastIndexOf(" "); if (lastBlankIndex == -1) {//没找到空格，就返回该单词的长度 return s.length(); } lastWord = s.substring(lastBlankIndex + 1);//从空格后一个字符开始 return lastWord.length(); }
[leetcode 58]Length of Last Word
标签：
原文地址：http://www.cnblogs.com/lingtingvfengsheng/p/4309680.html
