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.
先从头到尾进行遍历，遇到一个空格即一个单词结束，对该单词进行逆序，最后整体逆序

void reverseword(string &s, int i, int j){
        while(i<j){
          char t=s[i];
          s[i++]=s[j];
          s[j--]=t;
        } 
    }

    void reverseWords(string &s) {
        int i = 0, j = 0;
        int l = 0;
        int len=s.length();
        int wordcount=0;

        while(true){
            while(i < len && s[i] == ' ') i++; //去掉i位置之前的空格
            if(i == len) break;
            if(wordcount) s[j++] = ' ';//使得第一个单词之前没有加空格，后面的单词都要加空格
            l = j;
            while(i < len && s[i] != ' '){
                s[j] = s[i];
                j++;
                i++;
            }

            reverseword(s,l,j-1);
            wordcount++;
        }
        s.resize(j); /*resize(n) 调整容器的长度大小，使其能容纳n个元素。如果n小于容器的当前的size，则删除多出来的元素。
否则，添加采用值初始化的元素。*/
        reverseword(s,0,j-1);   
    }