1 class Solution {
 2 public:
 3     void reverseWords(string &s) {
 4         string result;
 5         int len = s.size();
 6         for (int i = len-1; i >= 0; i--) {
 7             if (s[i] == ' ') {
 8                 len = i;
 9             } else if (i == 0 || s[i-1] == ' ') {
10                 result += s.substr(i, len-i) + ' ';
11             }
12         }
13         s = result.substr(0, result.size()-1);
14     }
15 };

 

posted on 2015-03-23 10:13  keepshuatishuati  阅读(90)  评论(0编辑  收藏  举报