翻转字符串中的单词

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.

class Solution {
public:
    void reverseStr(string &s, int left, int right)
    {
        while (left < right)
        {
            swap(s[left], s[right]);
            left++;
            right--;
        }
    }
    
    void reverseWords(string &s) {
        int len = s.length();
        int count = -1;
        int begin = -1;
        bool spaceFound = false;
        for (int i = 0; i < len; i++)
        {
            if (s[i] != ' ')
            {
                if (begin == -1)
                {
                    begin = 0;
                }
                else if (spaceFound)
                {
                    spaceFound = false;
                    s[++count] = ' ';
                }
                s[++count] = s[i];
            }
            else if (begin != -1)
            {
                spaceFound = true;
            }
        }

        if (begin == -1)
        {
            s = "";
            return;
        }
        s = s.substr(begin, count+1);

        len = s.length();
        int left = -1;
        int right;
        for (int i = 0; i < len; i++)
        {
            if (s[i] != ' ')
            {
                if (left == -1)
                {
                    left = i;
                    right = i;
                }
                else
                {
                    right = i;
                }

                if (i == len-1)
                {
                    reverseStr(s, left, right);
                }
            }
            else
            {
                if (left != -1)
                {
                    reverseStr(s, left, right);
                }
                left = -1;
            }
        }
        reverseStr(s, 0, len-1);
    }
};