-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode_001.cpp
53 lines (49 loc) · 1.11 KB
/
leetcode_001.cpp
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
#include <iostream>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
class Solution {
public:
void reverseWords(string &s) {
char temp;
int l = s.size();
int mid = l / 2;
for (int i = 0; i <= mid; ++i)
{
temp = s[i];
s[i] = s[l-1-i];
s[l-1-i] = temp;
}
int start = 0;
int end = -1;
for (int i = 0; i < l; ++i)
{
if (s[i] == ' ')
{
end = s[i];
mid = (start + end) / 2;
for (int i = start; i <= mid; ++i)
{
temp = s[i];
s[i] = s[end+start-i];
s[end+start-i] = temp;
}
}
++start;
}
}
};
int main()
{
//freopen("d:\\1.txt", "r", stdin);
//freopen("d:\\2.txt", "w", stdout);
string s;
vector<string> stack;
while (cin>>s)
{
Solution sol;
sol.reverseWords(s);
}
return 1;
}