美文网首页Algorithm
LeetCode #58. Length of Last Wor

LeetCode #58. Length of Last Wor

作者: 匠_心 | 来源:发表于2017-06-07 17:37 被阅读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;
        }
    };
    
    

    相关文章

      网友评论

        本文标题:LeetCode #58. Length of Last Wor

        本文链接:https://www.haomeiwen.com/subject/pidafxtx.html