LeetCode学习(1) Reverse Words in a String

1.问题描述： Given an input string, reverse the string word by word. For example, Given s = “the sky is blue”, return “blue is sky the”. 2.问题分析： 利用两个stack，一个表示单词，一个表示句子。当遇到非空格字符时放入单词stack；当遇到空格时将单词stack中的字符压入句子stack中（注意：单词此时已经逆序一次），然后仅添加一个空格。最后将句子stack依次输出，此时句子逆序。 3.编程环境：c++ vs2013

#include<iostream>
#include "coordin.h"
#include<stack>
using namespace std;
void reverseWords(string &s) {
        stack<char> word;
        stack<char> sentence;
        int i = 0;
        while (i <= s.size()){
            if (i == s.size() || s[i] ==  ){
                if (!word.empty()){
                    if (!sentence.empty()){
                        sentence.push( );
                    }
                      while (!word.empty()){
                        sentence.push(word.top());
                        word.pop();
                    }
                }
            }
            else{
                word.push(s[i]);
        }
        i++;
        };
        s.clear();      
        while (!sentence.empty()){      
            cout << sentence.top();
            sentence.pop();
        };
    }
int main()
{   
    string s = "the sky is blue";
    reverseWords(s);
    return 0;
}