LeetCode: 151. Reverse Words in a String

LeetCode: 151. Reverse Words in a String

题目描述

Given an input string, reverse the string word by word.

Example:

Input: "the sky is blue",
Output: "blue is sky the".

Note:

A word is defined as a sequence of non-space characters.
Input string may contain leading or trailing spaces. 
However, your reversed string should not contain leading or trailing spaces.
You need to reduce multiple spaces between two words to a single space in the reversed string.

解题思路

获取用空格分割开的单词,然后将他们的倒序插入结果串中。

AC 代码

class Solution {
public:
    void reverseWords(string &s) {
        string ans;
        int lastPos = s.find_first_not_of(' ');
        int curPos = s.find_first_of(' ', lastPos);

        while(lastPos != s.npos)
        {    
            if(curPos == s.npos) curPos = s.size();

            if(!ans.empty()) ans = " " + ans;
            ans = s.substr(lastPos, curPos - lastPos) + ans;

            lastPos = s.find_first_not_of(' ', curPos);
            curPos = s.find_first_of(' ', lastPos);
        }

        s = ans;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值