[面试算法题重做]翻转句子中单词的顺序

             1
            void Reverse(conststring& inStr) {
 2     stack<string> strStack;
 3string temp;
 4for (int i = 0; i < inStr.length(); ++i) {
 5if(!isspace(inStr[i]))  {
 6             temp += inStr[i];
 7         } else {
 8            strStack.push(temp);
 9             temp = "";
10        }
11    }
12// 这里压入最后一个值13    strStack.push(temp);
14// 这里必须声明变量，因为你在操作栈，size是变化的，一定要注意15int stackSize = strStack.size();
16for (int i = 0; i < stackSize; i++) {
17         cout << strStack.top() << ""18        strStack.pop();
19    }
20 }

             1
            void Reverse(conststring& s) 
 2{ 
 3string temp; 
 4     vector<string> result; 
 5for(int i = 0; i < s.length(); ++i) 
 6    { 
 7if(isspace(s[i])) 
 8        { 
 9            result.push_back(temp); 
10             temp = ""; 
11        } 
12else13             temp += s[i]; 
14    } 
15    result.push_back(temp); 
16for(int j = result.size()-1; j != -1; --j) 
17         cout<<result[j]<<""; 
18     cout<<endl; 
19 }