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.

分析：细节实现题，关键点是单词长度计数更新的条件，因为有可能最后一个单词后面有一些trailing spaces，所以条件应为space后有一个非空格字符出现。代码如下:

class Solution {
public:
    int lengthOfLastWord(const char *s) {
        int result = 0;
        while(*s){
            if(*s++ != ' ')
                result++;
            else if(*s && *s != ' ')//condition of setting result to 0 is a non-sapce character following a sapce appears
                result = 0;
        }
        return result;
    }
};