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

思路分析：这题算法很简单，用一个栈就可以搞定。trick part见如下的说明

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.

可见，即使是很简单的题目也可以有陷阱，需要想得很周全。一般如果面试题简单，那么面试官对于solution的期望会更高，需要答题者对于所有可能的输入输出情况考虑周全，这需要做题的时候与面试官充分的问答互动。我实现的时候用到了java 正则匹配一个或者多个空白符[\s]+，替换成空格后再按照空格split。

AC Code

public class Solution {
    public String reverseWords(String s) {
        Stack<String> stack = new Stack<String>();
        String res = "";
        for(String token : s.replaceAll("[\\s]+", " ").split(" ")){
            stack.push(token);
        }
        
        while(!stack.empty()){
            res += stack.pop() + " ";
        }
        return res.trim();
    }
}