LeetCode OJ Reverse Words in a String

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

For example,
Given s = "the sky is blue",
return "blue is sky the".

click to show clarification.

Clarification:

  • What constitutes a word?
    A sequence of non-space characters constitutes a word.
  • Could the input string contain leading or trailing spaces?
    Yes. However, your reversed string should not contain leading or trailing spaces.
  • How about multiple spaces between two words?
    Reduce them to a single space in the reversed string.

class Solution {
public:
    void reverseWords(string &s) {
        bool first = true;
        string temp = " ";
        temp += s + " ";
        s.clear();
        for (int i = temp.size() - 1; i > 0;) {
            if (temp[i] == ' ' && temp[i - 1] != ' ') {
                int j;
                for (j = i - 1; j > 0; j--) {
                    if (temp[j] != ' ' && temp[j - 1] == ' ') {
                        if (!first) {
                            s += " ";
                        }
                        first = false;
                        s += temp.substr(j, i - j);
                        break;
                    }
                }
                i = j - 1;
            } else {
                i--;
            }
        }
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值