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.

click to show clarification.

Clarification:

• What constitutes a word?
  A sequence of non-space characters constitutes a word.
• Could the input string contain leading or trailing spaces?
  Yes. However, your reversed string should not contain leading or trailing spaces.
• How about multiple spaces between two words?
  Reduce them to a single space in the reversed string.

 

Analyse: first reverse the entire string, then have wordBegin as the index for the starting position of the word, find the left and right index of a word, reverse from left to right, copy left to right to wordBegin, set ' ' to the next of that word, set correct index for wordBegin.

Be aware of the empty string, the length of word equals to 1. 

Runtime: 9ms

class Solution {
public:
    void reverseWords(string &s) {
        if (s.empty()) return;
        reverse(s.begin(), s.end());
        
        int left = 0, right = 0, wordBegin = 0;
        int index = 0;
        for (; index < s.size(); index++) {
            if (isspace(s[index])) continue;
            if (index == 0 || isspace(s[index - 1]))
                left = index;
            if (index == s.size() - 1 || isspace(s[index + 1])) right = index;
            else continue;
            
            reverse(s.begin() + left, s.begin() + right + 1);
            // leading 0s before the word
            if (wordBegin < left) {
                while (left <= right) {
                    s[wordBegin++] = s[left++];
                }
                s[wordBegin] = ' ';
                wordBegin++;
            } else {
                wordBegin = right + 2;
            }
        }
        wordBegin = wordBegin ? wordBegin : 1;
        s.erase(s.begin() + wordBegin - 1, s.end());
    }
};