58. 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.length() == 0){
            return 0;
        }
        int count = 0;
        int len = s.length() - 1;
        //找最后一个单词
        while(s.charAt(len) == ' '){
            if(len == 0)
                return 0;
            len--;

        }
        //找到最后的单词后，进行统计
        while(len >= 0){

            if(s.charAt(len) != ' '){
                count++;
            }else{
                return count;
            }
            len--;
        }
        return count;
    }
}