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

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

    class Solution {
    public:
        int lengthOfLastWord(const char *s) {
            if (s == NULL) return 0;
            int mlen = 0, len = 0;
            bool inword = false;
            int pos = 0;
            char ch = 0;
            while ((ch = s[pos]) != '') {
                if (ch != ' ') {
                    if (!inword) inword = true;
                    len++;
                } else if (inword) {
                    if (len > 0) mlen = len;
                    len = 0;
                    inword = false;
                }
                    pos++;
            }
            if (len > 0) mlen = len;
            return mlen;
        }   
    };

    水一发,

    简化一下:

    class Solution {
    public:
        int lengthOfLastWord(string s) {
            int len = s.size();
            int wlen = 0;
            int pi = len - 1;
            while (pi >= 0 && s[pi] == ' ') {
                pi--;
            }
            while (pi >= 0 && s[pi] != ' ') {
                pi--;
                wlen++;
            }
            return wlen;
        }
    };
  • 相关阅读:
    poj1703--Find them, Catch them
    poj2828--Buy Tickets
    POJ 2594 Treasure Exploration(Floyd+最小路径覆盖)
    HDU
    二分图的一些性质
    HDU
    POJ 1659 Frogs' Neighborhood (Havel定理构造图)
    HDU
    HDU
    2018 Multi-University Training Contest 1
  • 原文地址:https://www.cnblogs.com/lailailai/p/3755799.html
Copyright © 2011-2022 走看看