zoukankan      html  css  js  c++  java
  • [leetcode] 058. 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.

    For example, 
    Given s = "Hello World",
    return 5.

    注意下非空串的末尾是空字符的情况就行

    public int lengthOfLastWord(String s) {
            int result = 0;
            if (s == null || s.length() == 0 || s.split(" ").length == 0) {
                return result;
            }
            if (!s.contains(" ")) {
                return s.length();
            }
            boolean lastChar = false;
            for (int i = s.length() - 1; i >= 0; i--) {
                if (' ' == s.charAt(i) && lastChar) {
                    break;
                }
                if (' ' != s.charAt(i)) {
                    if (!lastChar) {
                        lastChar = true;
                    }
                    result += 1;
                }
            }
            return result;
        }
  • 相关阅读:
    暴力,DFS,比较字符串
    暴力求解最大乘积
    油田!
    八皇后的问题
    巡逻的机器人
    骑士的移动
    二叉树遍历
    新兵训练(=@__@=)
    打牌~~~
    八皇后
  • 原文地址:https://www.cnblogs.com/pulusite/p/7593999.html
Copyright © 2011-2022 走看看