58. Length of Last Word

Problem

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

Code

static int var=[](){
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    return 0;
}();
class Solution {
public:
    int lengthOfLastWord(string s) {
        int len = 0;
        int i = s.size() - 1;
        while(s[i]==' ')
            i--;
        for(;i>=0;i--){
            if(s[i]==' ')
                break;
            else
                len++;
        }
        return len;
    }
};

Result

58. Length of Last Word.png

你可能感兴趣的:(58. Length of Last Word)