LeetCode String 151 Reverse Words in a String

151. Reverse Words in a String

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

Example 1:

Input: “the sky is blue”
Output: “blue is sky the”

Example 2:
Input: " hello world! "
Output: “world! hello”
Explanation: Your reversed string should not contain leading or trailing spaces.

Example 3:
Input: “a good example”
Output: “example good a”
Explanation: You need to reduce multiple spaces between two words to a single space in the reversed string.

Note:
A word is defined as a sequence of non-space characters.
Input string may contain leading or trailing spaces. However, your reversed string should not contain leading or trailing spaces.
You need to reduce multiple spaces between two words to a single space in the reversed string.

Follow up:
For C programmers, try to solve it in-place in O(1) extra space.

solution

采用正则表达式split原始字符串。然后调换顺序
需要注意一点的是：
String的’+'要比StringBuffer的.append()方法慢很多
下面代码分别采用了这两种写法

    public String reverseWords2(String s) {
        // phase 1: split the phrase
        // phase 2: reverse
        // " +" means to match one or multiple whitespaces
        String[] phrase = s.trim().split(" +");
        String out= "";
        for (int i = phrase.length-1; i >=0 ; i--) {
            if (i == 0) out = out + phrase[i];
            else out = out + phrase[i]+ ' ';
        }
        return out;
    }

    public String reverseWords(String s) {
        String[] phrase = s.trim().split(" +");
        StringBuffer out = new StringBuffer();
        for (int i = phrase.length-1; i >=0 ; i--) {
            if (i == 0) out.append(phrase[i]);
            else out.append(phrase[i]).append(' ');
        }
        return out.toString();
    }