class Solution {
public:
string reverseWords(string s) {
reverse(s.begin(), s.end()); //先把整个字符串翻转一遍
for (int i = 0; i < s.size(); i ++ )
{
int j = i;
while (j < s.size() && s[j] != ' ') j ++ ;
reverse(s.begin() + i, s.begin() + j); //再将每个以空格隔开的单词翻转一遍
i = j;
}
return s;
}
};