leetcode— Length of Last Word

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.
Example:
Input: “Hello World”
Output: 5

class Solution {
    public int lengthOfLastWord(String s) {
        if(s==null || s.length()<=0) return 0;
        int idx2 = s.length()-1;
        while(idx2>=0 && s.charAt(idx2)==' ') idx2--;
        int idx1 = idx2;
        while(idx1>=0 && s.charAt(idx1)!=' ')idx1--;
        return idx2-idx1;
    }
}

这个题目主要需要注意的是字符串末尾的空格，其他的就比较简单，找到最后一个字符的第一个字符位置和最后一个字符位置即可