Leetcode: 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".

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.

如果不考虑空格，先全部翻转，然后寻找空格位置，对单词再翻转，就得到结果，这样不需要额外的空间。时间复杂度O(N^2) 【是吗？不太确定。。。

class Solution {
public:
    void reverseWords(string &s) {
        if (s.length() <= 1) {
            return;
        }
        int start = 0;
    	int end = s.length() - 1;
	reverseString(s, start, end);
	int flag = 0;
	while (start <= s.length() - 1) {
		if (s[flag] == ' ' || s[flag] == '\0') {
		<span style="white-space:pre">	</span>reverseString(s, start, flag - 1);
			start = flag + 1;
		}
		flag++;
<span style="white-space:pre">	</span>}
	
    }

    void reverseString(string &str, int start, int end) {
	while (start < end) {
		char temp = str[start];
	<span style="white-space:pre">	</span>str[start++] = str[end];
		str[end--] = temp;
	}
    }
};

如果考虑空格，in place的做法就比较困难。下面代码的思路是从尾开始取值存入一个string里，遇到空格就翻转这个string，并加到结果里，处理空格。最后结果赋值给s。时间和空间复杂度都是n。

class Solution {
public:
    void reverseWords(string &s) {
        string ss;
        for (int i = s.length() - 1; i >= 0; ) {
            while (s[i] == ' ' && i >= 0) i--;
            if (i < 0) break;
            if (!ss.empty()) ss.push_back(' ');
            string word;
            while (s[i] != ' ' && i >=0) word.push_back(s[i--]);
            reverse(word.begin(), word.end());
            ss.append(word);
        }
        s = ss;
    }
};