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.

分析与思路

从后往前开始两个不相邻空格之间的字符即最后一个word，所以处理方法很直接。

OK，代码如下：

class Solution {
public:
    int lengthOfLastWord(string s) {
        int position = s.length()-1;
        for(; position>=0; position--)
        {
            if(s.at(position) == ' ')
				continue;
			else   
				break;
        }
        if(position == -1)   return 0;
        else
        {
            int cnt=0;
            for(int i=position;i>=0;i--)
            {
                if(s.at(i) == ' ')
					break;
				cnt++;
            }
            return cnt;
        }
    }
};