LeetCode-Solutions-in-Cpp17/src/0151.cpp at master · downdemo/LeetCode-Solutions-in-Cpp17 · GitHub

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
class Solution {
 public:
  string reverseWords(string s) {
    trim(s);
    reverse(s.begin(), s.end());
    int l = 0;
    int r = 0;
    while (l < s.size()) {
      while (l < s.size() && s[l] == ' ') {
        ++l;
      }
      r = l + 1;
      while (r < s.size() && s[r] != ' ') {
        ++r;
      }
      reverse(s.begin() + l, s.begin() + r);
      l = r;
    }
    return s;
  }

  void trim(string& s) {
    int l = 0;
    int r = 0;
    int cur = 0;
    while (cur < s.size() && l < s.size()) {
      while (l < s.size() && s[l] == ' ') {
        ++l;
      }
      r = l + 1;
      while (r < s.size() && s[r] != ' ') {
        ++r;
      }
      if (l >= s.size()) {
        break;
      }
      for (int i = l; i < r; ++i) {
        s[cur] = s[i];
        ++cur;
      }
      if (cur >= s.size()) {
        return;
      }
      s[cur] = ' ';
      ++cur;
      l = r;
    }
    s = s.substr(0, cur - 1);
  }
};