标签：
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.
A word is defined as a character sequence consists of non-space characters only.
Given s = "Hello World", return 5.
分析：
First, remove leading and tailing white spaces, and then use a for loop to find the index of the last white space.
1 public class Solution { 2 /** 3 * @param s A string 4 * @return the length of last word 5 */ 6 public int lengthOfLastWord(String s) { 7 // Write your code here 8 if (s == null || s.length() == 0) return 0; 9 s = s.trim(); 10 11 int startIndex = 0; 12 for (int i = 0; i < s.length(); i++) { 13 if (s.charAt(i) == ‘ ‘) { 14 startIndex = i + 1; 15 } 16 } 17 return s.length() - startIndex; 18 } 19 }
标签：
原文地址：http://www.cnblogs.com/beiyeqingteng/p/5666187.html
