Leetcode之Unique Binary Search Trees II

最新推荐文章于 2024-09-16 17:05:22 发布

一只荣

最新推荐文章于 2024-09-16 17:05:22 发布

阅读量78

点赞数

分类专栏： leetcode和机试题文章标签： leetcode

本文链接：https://blog.csdn.net/qq_35455503/article/details/90440722

版权

leetcode和机试题专栏收录该内容

509 篇文章 3 订阅

订阅专栏

题目：

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

代码：

class Solution {
public:
    vector<TreeNode *> generateTrees(int n) {
        vector<TreeNode*> v;
        if(n<=0)return v;
        return GenerateSubTree(1, n + 1);
    }

    vector<TreeNode*> GenerateSubTree(int l, int r) {
        vector<TreeNode *> subTree;

        if (l >= r) {
            subTree.push_back(NULL);
            return subTree;
        }

        if (l == r - 1) {
            subTree.push_back(new TreeNode(l));
            return subTree;
        }


        for (int i = l; i < r; ++i) {
            vector<TreeNode *> leftSubTree = GenerateSubTree(l, i);
            vector<TreeNode *> rightSubTree = GenerateSubTree(i + 1, r);

            for (int m = 0; m < leftSubTree.size(); ++m) {
                for (int n = 0; n < rightSubTree.size(); ++n) {
                    TreeNode *root = new TreeNode(i);
                    root->left = leftSubTree[m];
                    root->right = rightSubTree[n];
                    subTree.push_back(root);
                }
            }
        }

        return subTree;
    }
};

想法：多多拓展思路，采用递归法