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.

分析
字符串序列中最后一个word的长度。
顺序扫描，记录每个word的长度，返回即可。

代码

class Solution {public:    int lengthOfLastWord(string s) {        int len = 0;        for (size_t i = 0; i < s.size();) {            if (s[i++] != ' ')                ++len;            else if (i < s.size() && s[i] != ' ')                 len = 0;        }        return len;    }};