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 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.

class Solution {public:    int lengthOfLastWord(string s) {        int len = s.length();        if(len == 0)            return 0;        reverse(s.begin(), s.end());        int count = 0;        int i = 0;        while(i<len && !isalpha(s[i]))            i++;        for(; i<len; i++)            if(isalpha(s[i]))                count++;            else                return count;        return count;    }};