Algorithm

LeetCode #58. Length of Last Wor

2017-06-07  本文已影响0人  匠_心

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(string s)
    {
        if (s.size() == 0)
            return 0;
    
        int count = 0;
        for (auto iter = s.crbegin(); iter != s.crend(); ++iter)
        {
            if (*iter == ' ' && count != 0)
                break;
            if (*iter != ' ')
                ++count;
        }
    
        return count;
    }
};

上一篇 下一篇

猜你喜欢

热点阅读