Given an input string, reverse the string word by word.
For example,
Given s = "the sky is blue",
return
"blue is sky the".
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55 |
class
Solution {public: void
reverseWords(string &s) { stack<string> sk; if(s.size()==0)return
; int
i = 0; int
b = 0,e = 0; if(s.size()==1) { if(s[0] == ‘ ‘) { s = ""; return; } else
return; } for(i = 0 ; i < s.size()-1;i++) { if(s[i] == ‘ ‘&&s[i+1] != ‘ ‘) { b = i+1; } else
if(s[i] != ‘ ‘
&& s[i+1] == ‘ ‘) { e = i+1; string tp = s.substr(b,e-b); sk.push(tp); } } if(s[s.size()-1] != ‘ ‘) { string tp = s.substr(b,s.size()); // if(b != e) { sk.push(tp); } } if(sk.empty()) { s=""; return; } s = sk.top(); sk.pop(); while(!sk.empty()) { string tp = sk.top(); s = s + ‘ ‘+tp; sk.pop(); } //s = s+‘\0‘; }}; |
Reverse Words in a String,布布扣,bubuko.com
原文：http://www.cnblogs.com/pengyu2003/p/3621118.html