文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
1. Description
2. Solution
- First Try
1 | class Solution { |
- Second Try
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
38class Solution {
public:
void reverseWords(string &s) {
reverseWords(s, 0, s.size() - 1);
removeAndRemoveMiddleSpace(s);
}
void reverseWords(string& s, int start, int end) {
for(int i = start, j = end; i < j; i++, j--) {
char temp = s[i];
s[i] = s[j];
s[j] = temp;
}
}
void removeAndRemoveMiddleSpace(string &s) {
s.erase(0, s.find_first_not_of(" "));
s.erase(s.find_last_not_of(" ") + 1);
int i = 0;
int j = 1;
int k = 0;
while(j < s.size()) {
if(s[j] == ' ' && s[j - 1] != ' ') {
reverseWords(s, k, j - 1);
i = j;
}
if(s[j] == ' ' && s[j + 1] != ' ') {
if(i != j) {
s.erase(i + 1, j - i);
j = i;
}
k = j + 1;
}
j++;
}
reverseWords(s, k, j - 1);
}
};