LeetCode 151 Reverse Words in a String (字符串处理 推荐)

Given an input string, reverse the string word by word.

For example,
Given s = "the sky is blue",
return "blue is sky the".

Update (2015-02-12):
For C programmers: Try to solve it in-place in O(1) space.

题目链接：https://leetcode.com/problems/reverse-words-in-a-string/

题目分析：本次校招这题遇到过三次。。。所以就推荐一下吧，其实也并不难，先把空格处理下，然后全部逆序，再分别对每个单词逆序，逆序的逆序就是正序了，6ms，击败63%

class Solution {
public:

    void removeSpace(string &s){
        for (int i = 0; i < s.length(); i ++) {
            while (s[i] == ' ' && (s[i + 1] == ' ' || i == 0 || i == s.length() - 1)) {
                s.erase(i, 1);
            }
        }
    }
    
    void reverseStr(string &s, int i, int j) {
        while (i < j) {
            swap(s[i ++], s[j --]);
        }
    }

    void reverseWords(string &s) {
        removeSpace(s); 
        if (s == "") {
            return;
        }
        int len = s.length();
        reverseStr(s, 0, len - 1);
        int cur = 0;
        s += ' ';
        for (int i = 0; i <= len; i ++) {
            if (s[i] == ' ') {
                reverseStr(s, cur, i - 1);
                cur = i + 1;
            }
        }
        s.erase(len);
    }
};