LeetCode 题解（138）: 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.

题解：

纯考各语言的字符串处理语法。比较起来Python真是开了外挂般强大。

C++版：

#include <sstream>
#include <iterator>

class Solution {
public:
    void reverseWords(string &s) {
        istringstream buf(s);
        istream_iterator<string> beg(buf), end;
        vector<string> tokens(beg, end);
        string result;
        for(auto iter = tokens.rbegin(); iter != tokens.rend(); iter++) {
            result += *iter;
            result += " ";
        }
        s = result.substr(0, result.length()-1);
    }
};

Java版：

public class Solution {
    public String reverseWords(String s) {
        String[] y = s.trim().split("\\s+");
        StringBuilder r = new StringBuilder();
        for(int i = y.length - 1; i > 0; i--) {
            r.append(y[i]);
            r.append(" ");
        }
        r.append(y[0]);
        return r.toString();
    }
}

Python版：

class Solution:
    # @param s, a string
    # @return a string
    def reverseWords(self, s):
        return " ".join([s.split()[i] for i in range(len(s.split()) - 1, -1, -1)])