[LeetCode] Reverse Words in a String

原题:https://oj.leetcode.com/problems/reverse-words-in-a-string/

题解：该题通过Java来解非常简单，通过split函数按空格分隔即可，但是本题有很多陷阱；比如字符串收尾有空格，或本身就是一个空格；这时就需要去判断分隔后的元素的长度，代码如下：

public class Solution {
public String reverseWords(String s) {
        if(s == null)
            return s;
        String[] sa = s.split(" ");
        StringBuilder sb = new StringBuilder();
        boolean first = true;
        for(int i = sa.length-1; i >= 0; i--){
            if(sa[i].length() != 0){
                if(first){
                    sb.append(sa[i]);
                    first = false;
                }
                else{
                    sb.append(" ").append(sa[i]);
                }
            }
        }
        return sb.toString();
    }
}