151. Reverse Words in a String (String)

思路: 本题考查的目的并不是使用字符串的函数。方法是两次reverse，先对每个单词先做一次翻转，然后对整个字符串做一次翻转。

需要注意的是去除extra space，并且对全space字符串、以及最后一个单词要做特殊处理。

class Solution {
public:
    void reverseWords(string &s) {
        int start = ;
        int end=-;
        int i = ;
        int cur = ; // point to the string with extra space deleted

        //ignore space at the beginning
        while(i < s.length() && s[i]==' '){
            i++;
        }

        for(;i<s.length();i++){
            if(s[i]==' ' && i+ < s.length() && s[i+] ==' ') continue; //ignore extra space between words
            if(s[i]==' ' && i+ == s.length()) break; //ignore final space
            s[cur++] = s[i];
            if(s[i]==' '){
                end = cur-; //end case1: the letter before space
                reverse(s, start, end);
                start = cur;
            }
        }
        end = cur-; //end case2: the last not space letter!!!
        if(end == -) s = ""; //special case: null string!!!
        if(s[i-] != ' '){ //reverse the last word!!!
            reverse(s,start,end);
        }
        cout << "end=" << end << endl;
        s = s.substr(, end+);
        reverse(s,,end);
    }

    void reverse(string &s, int start, int end){
        int l = start;
        int r = end;
        char tmp;
        while(l<r){
            tmp = s[l];
            s[l]=s[r];
            s[r]=tmp;
            l++;
            r--;
        }
    }
};