Unique Binary Search Trees II 二叉查找树的路径
来源:互联网 发布:电脑怎么打开淘宝口令 编辑:程序博客网 时间:2024/05/22 13:03
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<TreeNode*> generate(int beg,int end)
{
vector<TreeNode*> ret;
if(beg>end)
{
ret.push_back(NULL);
return ret;
}
for(int i=beg;i<=end;i++)
{
vector<TreeNode*> leftTree=generate(beg,i-1);
vector<TreeNode*> rightTree=generate(i+1,end);
for(int j=0;j<leftTree.size();j++)
{
for(int k=0;k<rightTree.size();k++)
{
TreeNode *node=new TreeNode(i+1);
ret.push_back(node);
node->left=leftTree[j];
node->right=rightTree[k];
}
}
}
return ret;
}
vector<TreeNode *> generateTrees(int n) {
return generate(0,n-1);
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<TreeNode*> generate(int beg,int end)
{
vector<TreeNode*> ret;
if(beg>end)
{
ret.push_back(NULL);
return ret;
}
for(int i=beg;i<=end;i++)
{
vector<TreeNode*> leftTree=generate(beg,i-1);
vector<TreeNode*> rightTree=generate(i+1,end);
for(int j=0;j<leftTree.size();j++)
{
for(int k=0;k<rightTree.size();k++)
{
TreeNode *node=new TreeNode(i+1);
ret.push_back(node);
node->left=leftTree[j];
node->right=rightTree[k];
}
}
}
return ret;
}
vector<TreeNode *> generateTrees(int n) {
return generate(0,n-1);
}
};
0 0
- Unique Binary Search Trees II 二叉查找树的路径
- 164.Unique Binary Search Trees II-不同的二叉查找树 II(中等题)
- **[Lintcode]Unique Binary Search Trees II 不同的二叉查找树 II
- Unique Binary Search Trees II 二叉树的种类
- Unique Binary Search Trees 二叉查找树的数量
- 【LeetCode】Unique Binary Search Trees 二叉查找树的个数
- LeetCode 95. Unique Binary Search Trees II&96. Unique Binary Search Trees--动态规划,二叉树
- LeetCode-95-Unique Binary Search Trees II 二叉树
- LeetCode:Unique Binary Search Trees(二叉查找树)
- (二叉查找树)LeetCode#96. Unique Binary Search Trees
- Unique Binary Search Trees II 输出二叉树的所有组合@LeetCode
- LeetCode OJ 之 Unique Binary Search Trees II (不同的二叉搜索树 - 二)
- 95. Unique Binary Search Trees II (独一无二的二叉搜索树之二)
- 能构成的二叉查找树的个数 Unique Binary Search Trees
- 163.Unique Binary Search Trees-不同的二叉查找树(中等题)
- Unique Binary Search Trees II
- Unique Binary Search Trees II
- Unique Binary Search Trees II
- solaris 内存使用率
- 解读HDFS
- Linq Provider for MySql, Oracle and PostgreSQL Linq to Oracle 使用教程目录
- 批量修改Oracle序列值的存储过程
- Docker学习笔记之一,搭建一个JAVA Tomcat运行环境
- Unique Binary Search Trees II 二叉查找树的路径
- ThreadPoolExecutor几点应用建议
- 向服务器当中传递数据 ftp 安装与使用
- iOS问题
- Set and Read Memory ID in ABAP OO
- 改变常量的值===引用===引用和指针区别
- 记录
- android system.out.print 显示打印
- 变革性的Java Web模板技术 -- fastm