LeetCode: Reverse Words in a String

LeetCode: 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".

题目地址：https://oj.leetcode.com/problems/reverse-words-in-a-string/

算法：先把字符串分成一个一个word放在vector里面，然后在按逆序存入原来的字符串里。代码：

class Solution {
public:
    void reverseWords(string &s) {
        vector<string> words = split(s);
        s.clear();
        vector<string>::reverse_iterator iter = words.rbegin();
        if(iter != words.rend()){
            s += *iter;
            ++iter;
        }
        for(; iter != words.rend(); ++iter){
            s += " ";
            s += *iter;
        }
    }
    vector<string> split(const string &s){
        string t;
        vector<string> words;
        string::const_iterator p = s.begin();
        while(p != s.end()){
            while(p != s.end() && isspace(*p)){
                ++p;
            }
            while(p != s.end() && !isspace(*p)){
                t.push_back(*p);
                ++p;
            }
            if(!t.empty()){
                words.push_back(t);
                t.clear();
            }
        }
        return words;
    }
};