题目描述

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.

Example:

Input: "Hello World"
Output: 5

注意，不管最后多少个 ' '，都不算最后一个word，最后一个 word 是非 ' '

Input: "Hello World  "
Output: 5

Input: "Hello World        "
Output: 5

题目思路

• 思路一、

class Solution {
public:
    int lengthOfLastWord(string s) {
        int len = s.size();
        int result = 0;
        bool flag = false;
        
        for(int i=len-1; i >= 0; i--){
            if(s[i] == ' '){
                if(flag == true){
                    break;
                }
                continue;
            }
            
            flag = true;
            result += 1;
        }
        return result;
    }
};

总结展望