leetcode:length of last world

1、

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.

2、

  

public class Solution {
    /**
     * @param s A string
     * @return the length of last word
     */
    public int lengthOfLastWord(String s) {
       int length = 0;
       //转化为数组
            char[] chars = s.toCharArray();
            for (int i = s.length() - 1; i >= 0; i--) {
                if (length == 0) {
                    if (chars[i] == ' ') {
                        continue;
                    } else {
                        length++;
                    }
                } else {
                    if (chars[i] == ' ') {
                        //停止
                        break;
                    } else {
                        length++;
                    }
                }
            }

            return length;
    }
}
工作小总结,有错请指出,谢谢。
原文地址:https://www.cnblogs.com/zilanghuo/p/5292773.html