LeetCode（三）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

思路：从后往前计数，数到第一个空格，则说明最后一个单词遍历结束
注意点：样例：""（空字符串），返回0
样例："a "，把字符串trim一下
补充：注意空字符串、空格串、NULL

        string str1=””;  // 空字符串  str1.length( )= 0
        string str2=NULL;  // NULL
        string str3=”  ”;   //空格串  str2.length() = 1

程序代码：

class Solution {
    public int lengthOfLastWord(String s) {
        int len = 0;
        //空格串trim掉为空字符串
        s = s.trim();
        if(s == ""){
            len = 0;
        }else{
            char[] chs = s.toCharArray();
            int i = chs.length - 1;
            while(i >= 0&&chs[i] != ' '){
                i--;
                len++;
            }
        }
        return len;
    }
}