leetcode算法题--Unique Binary Search Trees II

原题链接：https://leetcode.com/problems/unique-binary-search-trees-ii/

class Solution {public:vector<TreeNode*> generateTrees(int n) {return dfs(1, n);}vector<TreeNode*> dfs(int l, int r) {vector<TreeNode*> res;if (l > r) {res.push_back(NULL);return res;} for (int i = l; i <= r; i ++ ) {auto left = dfs(l, i - 1), right = dfs(i + 1, r);for (auto lt : left) {for (auto rt : right) {auto root = new TreeNode(i);root->left = lt;root->right = rt;res.push_back(root);}}}return res;}
};

leetcode算法题--Unique Binary Search Trees II相关推荐

leetcode 95. Unique Binary Search Trees II | 96. Unique Binary Search Trees
95. Unique Binary Search Trees II https://leetcode.com/problems/unique-binary-search-trees-ii/ 题解题是 ...
【重点递归构造二叉树】LeetCode 95. Unique Binary Search Trees II
LeetCode 95. Unique Binary Search Trees II 本博客转载自:[1]https://segmentfault.com/a/1190000007443961 [2] ...
Unique Binary Search Trees II -- LeetCode
原题链接: http://oj.leetcode.com/problems/unique-binary-search-trees-ii/ 这道题是求解所有可行的二叉查找树,从 Unique Bi ...
【Unique Binary Search Trees II】cpp
题目: Given n, generate all structurally unique BST's (binary search trees) that store values 1...n. F ...
LeetCode Unique Binary Search Trees II（递归或者dp）
问题:给出一个正整数,要求构造由1到n组成的所有的二叉搜索树思路: 1.递归法在求从1到n的二叉搜索树时,枚举中间值i(1到n),求[1,i-1]和[i+1,n]分别构成的二叉搜索树,然后根据左右 ...
LeetCode：96. Unique Binary Search Trees（找出独一无二搜索树）
文章最前: 我是Octopus,这个名字来源于我的中文名--章鱼:我热爱编程.热爱算法.热爱开源.所有源码在我的个人github :这博客是记录我学习的点点滴滴,如果您对 Python.Java.AI ...
95. Unique Binary Search Trees II
分成两边, left right排列组合加到root, lo==hi就返回当前值 1 class Solution { 2 public List<TreeNode> generateTr ...
95. Unique Binary Search Trees II 不同的二叉搜索树 II
给定一个整数 n,生成所有由 1 - n 为节点所组成的二叉搜索树 . 示例: 输入:3 输出: [[1,null,3,2],[3,2,null,1],[3,1,null,null,2],[2,1, ...
Leetcode95. Unique Binary Search Trees II不同的二叉搜索树2
给定一个整数 n,生成所有由 1 ... n 为节点所组成的二叉搜索树. 示例: 输入: 3 输出: [ [1,null,3,2], [3,2,null,1], [3,1,null,nul ...

leetcode算法题--Unique Binary Search Trees II

leetcode算法题--Unique Binary Search Trees II相关推荐

最新文章

热门文章