leetcode

0 class Solution {

1 public:

2 string reverseWords(string &s) {

3 s.push_back(' ');

4 for (int k = 0, last = -1; k <= s.size(); k++) {

5 if (s[k] != ' ') continue;

6 int i = last + 1, j = k - 1;

7 while (i < j)

8 swap(s[i++], s[j--]);

9 last = k;

10 }

11 s.pop_back();

12 return s;

13 }

14 };