58. Length of Last Word最后一个字符串的长度Leetcode

#58. Length of Last Word最后一个字符串的长度
问题描述：

难度：easy

Given a string s consists of some words separated by spaces, return the length of the last word in the string. If the last word does not exist, return 0.
A word is a maximal substring consisting of non-space characters only.
给定一串字符串，其中包含空格，输出最后一个字符串的长度

Example 1:
Input: s = "Hello World"
Output: 5

Example 2:
Input: s = " "
Output: 0

Example 3:
Input: s = "a  "
Output: 1

思路：
使用i标从后往前检测，i表示最后一个字符的位置，去掉最后最后几个空格，出现的第一个非空格的字符串，则开始计算长度count++。

class Solution {
public:
    int lengthOfLastWord(std::string s) {
        int count = 0;
        int i=s.size()-1;
        while(s[i] == ' ' && i>=0)
        {
            i--;
        }
        while(s[i] != ' ' && i>=0)
        {
            count++;
            i--;
        }

        return count;
    }
};