lurenaa的博客

  

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
class Solution {
public:
string reverseWords(string s) {
int bg = 0;
for(int i = 0; i < s.size(); ++i) {
if(s[i] == ' ' || i + 1 == s.size()){
int l = bg, r = i + 1 == s.size() ? i : i - 1;
while(l <= r) {
swap(s[l], s[r]);
++l;
--r;
}
bg = i + 1;
}
}
return s;
}
};

Accepted

30/30 cases passed (20 ms)

Your runtime beats 76.47 % of cpp submissions

Your memory usage beats 49.04 % of cpp submissions (12 MB)