DP动态规划专题三：LeetCode 95. Unique Binary Search Trees II

最新推荐文章于 2021-09-03 18:46:33 发布

原创最新推荐文章于 2021-09-03 18:46:33 发布 · 431 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

计算机算法专栏收录该内容

221 篇文章

订阅专栏

该博客介绍了如何解决LeetCode上的95题，即生成所有结构独特且存储1到n值的二叉搜索树的方法。内容探讨了如何递归地构建这些树，并指出解题方案依赖于较小值的树的构造。

Unique Binary Search Trees II

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

Example:

Input: 3
Output:
[
  [1,null,3,2],
  [3,2,null,1],
  [3,1,null,null,2],
  [2,1,3],
  [1,null,2,null,3]
]]
Explanation:
The above output corresponds to the 5 unique BST's shown below:

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

解释：n的答案依赖于0~n-1的答案

    public List<TreeNode> generateTrees(int n) {
        //a list to store all the answers, use list instead of map is because we need to use them by indexing the n
        List<List<TreeNode>> allResult = new ArrayList<>();
        //initialize the n = 0 situation
        List<TreeNode> list = new ArrayList<>();
        if(n == 0)return list;
        list.add(null);
        allResult.add(list);
        //iteration to get 1 ~ n
        for (int i = 1; i <= n; i++) {
            List<TreeNode> res = new ArrayList<>();
            for (int r = 1; r <= i; r++) {
                List<TreeNode> le = allResult.get(r-1);
                List<TreeNode> ri = allResult.get(i-r);
                for (TreeNode left : le) {
                    for (TreeNode right: ri) {
                        TreeNode root = new TreeNode(r);
                        root.left = get(left, 0);
                        // System.out.println("root.left : " + root.left);
                        root.right = get(right, r);
                        // System.out.println("root.right : " + root.right);
                        res.add(root);
                    }
                }
            }
            allResult.add(res);
        }
        return allResult.get(n);
    }
    private TreeNode get(TreeNode root, int offset) {
        if (root == null) return null;
        TreeNode cr = new TreeNode(root.val + offset);
        cr.left = get(root.left, offset);
        cr.right = get(root.right, offset);
        return cr;
    }