Leetcode 58(Java)

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.

先用trim()函数将最后的’ ‘的空格去掉，避免特殊情况出现。然后从尾巴开始判断，如果为’ ‘则退出。AC码如下：

 public class Solution {
    public int lengthOfLastWord(String s) {
        s=s.trim();
        int length=s.length();
        if("".equals(s)||" ".equals(s.charAt(length-1)))return 0;
        int count=0;
        for(int i=length-1;i>=0;i--){
            if(s.charAt(i)==' '){
                return count;
            }else{
                count++;
            }
        }
        return count;
    }
}