这道题参考答案,主要是要处理字符里的空格。
class Solution {
public:
string reverseWords(string s) {
const int n = s.length();
int i = 0;
while (i < n) {
int start = i;
while (i < n && s[i] != ' ') i++;
int left = start, right = i - 1;
while (left < right) {
swap(s[left], s[right]);
++left;
--right;
}
while (i < length && s[i] == ' ') i++;
}
return s;
}
};