面试经典150题——Day19

文章目录

    • 一、题目
    • 二、题解

一、题目

58. Length of Last Word

Given a string s consisting of words and spaces, return the length of the last word in the string.

A word is a maximal
substring
consisting of non-space characters only.

Example 1:

Input: s = “Hello World”
Output: 5
Explanation: The last word is “World” with length 5.
Example 2:

Input: s = " fly me to the moon "
Output: 4
Explanation: The last word is “moon” with length 4.
Example 3:

Input: s = “luffy is still joyboy”
Output: 6
Explanation: The last word is “joyboy” with length 6.

Constraints:

1 <= s.length <= 104
s consists of only English letters and spaces ’ '.
There will be at least one word in s.

题目来源: leetcode

二、题解

class Solution {
public:
    int lengthOfLastWord(string s) {
        vector<string> res;
        istringstream ss(s);
        string token;
        while(getline(ss,token,' ')) res.push_back(token);
        int n = res.size();
        for(int i = n - 1;i >= 0;i--){
            if(res[i] != "") return res[i].length();
        }
        return 0;
    }
};

你可能感兴趣的:(数据结构,leetcode,c++,算法,字符串)