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.
package Leetcode; public class LengthofLastWord { public int lengthOfLastWord(String s) { char [] chars=s.toCharArray(); int length=0; for(int i=chars.length-1;i>0;i--){ if(length==0){ if(chars[i]==‘ ‘){ continue; } else{ length++; } } else{ if(chars[i]==‘ ‘){ break; } else{ length++; } } } return length; } }
leetcode length of the last word
原文：http://www.cnblogs.com/lilyfindjobs/p/4077768.html