【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 (last word means the last appearing word if we loop from left to right) in the string.

If the last word does not exist, return 0.

Note: A word is defined as a maximal substring consisting of non-space characters only.

Example:

Input: "Hello World"
Output: 5

代码如下：

class Solution {
public:
    int lengthOfLastWord(string s) {
        int n = s.size();
        int len = 0;
        bool hasSpace = false; //扫描的当前字符的前一个字符是不是空格
        
        for(int i = 0; i < n; i++) {
            if(s[i] != ' ') {
                if(hasSpace) {
                    len = 1;
                    hasSpace = false; // 当前字符不为空格，且前一个字符为空格，重新计算word长度, 并将标志位设置成false
                } else {
                    len++;
                }
            } else {
                hasSpace = true; // 遇到空格字符将标志位设置成true
            }
        }
        
        return len;
    }
};