[Leetcode]#58 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.

//#58 Length of Last Word
//4ms 99.72%
class Solution {
public:
    int lengthOfLastWord(string s) 
    {
        vector<char> word;
        bool new_word(false);
        for(unsigned int i=0; i<s.size(); i++)
        {
            if(s[i] == ' ')
            {
                new_word = true;
            }
            else
            {
                if(new_word)
                {
                    word.clear();
                    new_word = false;
                }
                word.push_back(s[i]);
            }
        }
        return word.size();
    }
};