leetcode-95. Unique Binary Search Trees II

leetcode-95. Unique Binary Search Trees II

题目：

Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.

For example,
Given n = 3, your program should return all 5 unique BST’s shown below.

1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3

这题第二遍做还是没做出来，我总是想怎么用动态规划区解，主要还是偷看了tag。想在n-1的基础上找n很久都没找到。这里实际上并不能算是DP算法。应该还是DFS方法或者分治算法。
思路就是针对1-n之间的每个i去找其左子节点和右子节点，分别形成TreeNode数组然后在数组里的互相匹配构成上一层的数组。算法设计的非常漂亮。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public List<TreeNode> generateTrees(int n) {
        if(n==0) return new ArrayList<TreeNode>();
        return helper(1,n);
    }

    private List<TreeNode> helper(int start , int end){
        List<TreeNode> ret = new ArrayList<TreeNode>();
        if(start>end){
            ret.add(null);
            return ret;
        }
        if(start == end){
            ret.add(new TreeNode(start));
            return ret;
        }
        List<TreeNode> left,right;
        for(int i = start;i<=end;i++){
            left = helper(start,i-1);
            right = helper(i+1,end);

            for(TreeNode l : left)
                for(TreeNode r : right){
                    TreeNode tmp = new TreeNode(i);
                    tmp.left = l;
                    tmp.right = r;
                    ret.add(tmp);
                }
        }
        return ret;
    }
}