反转单词顺序

/*Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". 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. */

//使用反转字符串方法，来实现单词顺序反转。

//基本原理：首先我们把待反转字符串（一段话）整体反转，
//比如说“I   am   a   student”反转为”tneduts a ma I”,

//然后再逐个单词反转，最后得到“student a  am  I”。

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
class Solution {
public:
    void ReverseAllChar(string& strSource,int iStart,int iEnd);
    void reverseWords(string& strSource);
    void DelNULLStart(string& strSource);
    void RemoveExtraSpace(string& strSource);
};
void Solution::RemoveExtraSpace(string& strSource)
{
    string s1;
    for(int i=0;i!=strSource.size();i++)
    {
        if(strSource[i]==' ')
        {
            s1+=strSource[i];
            while(strSource[i]==' ')
            i+=1;
        }
        s1+=strSource[i];
    }
    strSource = s1;
}
void Solution::DelNULLStart(string& strSource)
{
    string::size_type pos=strSource.find_first_not_of(' ');
    strSource.erase(0,pos);
}

void Solution::ReverseAllChar(string& strSource,int iStart, int iEnd)
{
     //   反转字符串
     reverse(strSource.begin()+iStart,strSource.begin()+iEnd);
}
void Solution::reverseWords(string& strSource)
{
    int Len;
    DelNULLStart(strSource);
    Len = strSource.size();
    reverse(strSource.begin(),strSource.end());
    DelNULLStart(strSource);
    RemoveExtraSpace(strSource);
    Len = strSource.size();

    int iStart = 0;
    int iEnd   = 0;
    bool flag  = false;
    for(int i =0; i<Len ; i++)
    {
        if(' ' == strSource[i])
        {
           iEnd = i;
           if(iStart<iEnd)
           {
               ReverseAllChar(strSource,iStart,iEnd);
           }
           iStart = i+1;
           flag = true;
        }
    }
    if(!flag)
    reverse(strSource.begin(),strSource.end());
    else
    {
        iEnd++;
        ReverseAllChar(strSource,iEnd,Len);
    }

}
int main()
{
    Solution *solution = new Solution();
    string strSource="hello world!";
      /*  solution->DelNULLStart(strSource);
        cout<<"ReverseWord Reault:"<<strSource<<endl;
    reverse(strSource.begin(),strSource.end());
    solution->DelNULLStart(strSource);
    cout<<"ReverseWord Reault:"<<strSource<<endl;
    solution->RemoveExtraSpace(strSource);*/
    solution->reverseWords(strSource);
    cout<<"ReverseWord Reault:"<<strSource<<endl;
}