Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return "blue is sky the".
class Solution {
public:
void reverseWords(string &s) {
stack<string> words;
int start = -1; //记录单词开始的位置
for(int i=0; i<s.length(); i++){
if(s[i]==' '){
if(i!=0 && s[i-1]!=' '){
//一个单词结束
words.push(s.substr(start, i-start));
start = -1;
}
}
else{
if(i==0 || s[i-1]==' '){
start = i;
}
}
}
if(start!=-1)words.push(s.substr(start, s.length()-start));
//拼接成反向单词
s = "";
int count=0;
while(!words.empty()){
count++;
if(count==1)s+=words.top();
else s+=" "+words.top();
words.pop();
}
}
};LeetCode: Reverse Words in a String [151],布布扣,bubuko.com
LeetCode: Reverse Words in a String [151]
原文地址：http://blog.csdn.net/harryhuang1990/article/details/36204923
