[LeetCode 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.

我：1、这也算是双指针，k记录一个单词开始的位置，j记录单词结束的位置

2、一开始在while循环中将插入操作放在了else中，发现当只有一个单词的时候会有问题，调换了顺序就A了。事后感觉还是逻辑没有整理好。

class Solution {
public:
    void reverseWords(string &s) {
        string r;
        int len = s.size();
        int i=len-1;
        int j,k,num;
        while(s[i]==' ')
            i--;
        num=0;
       // j=i;
        while(i>=0)
        {
            if(s[i]!=' ')
            {
                j=i;
                while(s[i]!=' '&&i>=0)
                {
                    i--;
                }
                if(num!=0)
                {
                    r.push_back(' ');
                }
                for(k=i+1;k<=j;k++)
                {
                    r.push_back(s[k]);
                }
                num++;
                
            }
            else
            {
                i--;
            }
        }
        s=r;
    }
};