[leetcode] 58. Length of Last Word 解题报告

题目连接：https://leetcode.com/problems/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) {        while(s[s.size()-1] == ' ') s.erase(s.size()-1);        return s.size() - s.rfind(' ') -1;    }};