151 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".

Update (2015-02-12):
For C programmers: Try to solve it in-place in O(1) space.

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) {
        if(s.empty())return ;
        int count = 0;
        for(int i = 0;i < s.size();i++)	 //去除开头的空格
        {
            if(s[i] == ' ')count++;
			else break;
        }
        if(count != 0)
        {
            s.erase(0,count);
            count = 0;
        }
        for(int i = s.size() -1;i >=0;i--) //去除结尾的空格
        {
            if(s[i] == ' ')count++;
			else break;
        }
        if(count != 0)
        {
            s.erase(s.size() -count,count);
            count = 0;
        }
        for(int i = 0;i <s.size();i++)//是不是只有一个单词
        {
            if(s[i] == ' ')count++;
        }
        if(count == 0)return ;
        stringstream ss(s);
        fanzhuan(ss);//递归
        res.erase(res.size()-1,1);//去掉最后的空格
        s =res;
    }
    void fanzhuan(stringstream & ss)
    {
        string tem;
        if(!(ss>>tem))return;
        fanzhuan(ss);
        res = res + tem + " ";
    }
private:

    string res;
};

也可以直接用stack来做

class Solution {
public:
    void reverseWords(string &s) {
        stack<string> mystack;
        //if(s.size()<=1)return ;
        int i = 0;
        while(i < s.size())
        {
            while(s[i] == ' ' && i < s.size())i++;
            int j = i;
			while(s[j] != ' ' && j< s.size())j++;
			//if(j > s.size() -1)break;
            string tem;
            tem = s.substr(i,j-i);
            mystack.push(tem);
            i = j;
        }
        string ss;
        while(!mystack.empty())
        {
            if(ss.length() != 0)ss += " ";
            ss += mystack.top();
            mystack.pop();
        }
        s = ss;
    }
};