LeetCode:Unique Binary Search Trees I II

LeetCode:Unique Binary Search Trees

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,
Given n = 3, there are a total of 5 unique BST's.

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

分析：依次把每个节点作为根节点，左边节点作为左子树，右边节点作为右子树，那么总的数目等于左子树数目*右子树数目，实际只要求出前半部分节点作为根节点的树的数目，然后乘以2（奇数个节点还要加上中间节点作为根的二叉树数目）

递归代码：为了避免重复计算子问题，用数组保存已经计算好的结果

class Solution {
public:
int numTrees(int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int nums[n+1]; //nums[i]表示i个节点的二叉查找树的数目
memset(nums, 0, sizeof(nums));
return numTreesRecur(n, nums);
}
int numTreesRecur(int n, int nums[])
{
if(nums
!= 0)return nums
;
if(n == 0){nums[0] = 1; return 1;}
int tmp = (n>>1);
for(int i = 1; i <= tmp; i++)
{
int left,right;
if(nums[i-1])left = nums[i-1];
else left = numTreesRecur(i-1, nums);
if(nums[n-i])right = nums[n-i];
else right = numTreesRecur(n-i, nums);
nums
+= left*right;
}
nums
<<= 1;
if(n % 2 != 0)
{
int val;
if(nums[tmp])val = nums[tmp];
else val = numTreesRecur(tmp, nums);
nums
+= val*val;
}
return nums
;
}
};

非递归代码：从0个节点的二叉查找树数目开始自底向上计算，dp方程为nums[i] = sum(nums[k-1]*nums[i-k]) (k = 1,2,3...i)

class Solution {
public:
int numTrees(int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
int nums[n+1]; //num[i]表示i个节点的二叉查找树数目
memset(nums, 0, sizeof(nums));
nums[0] = 1;
for(int i = 1; i <= n; i++)
{
int tmp = (i>>1);
for(int j = 1; j <= tmp; j++)
nums[i] += nums[j-1]*nums[i-j];
nums[i] <<= 1;
if(i % 2 != 0)
nums[i] += nums[tmp]*nums[tmp];
}
return nums
;
}
};

LeetCode:Unique Binary Search Trees II

Given 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

按照上一题的思路，我们不仅仅要保存i个节点对应的BST树的数目，还要保存所有的BST树，而且1、2、3和4、5、6虽然对应的BST数目和结构一样，但是BST树是不一样的，因为节点值不同。

我们用数组btrees[i][j][]保存节点i, i+1,...j-1,j构成的所有二叉树，从节点数目为1的的二叉树开始自底向上最后求得节点数目为n的所有二叉树 本文地址

/**
* 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 *> generateTrees(int n) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
vector<vector<vector<TreeNode*> > > btrees(n+2, vector<vector<TreeNode*> >(n+2, vector<TreeNode*>()));
for(int i = 1; i <= n+1; i++)
btrees[i][i-1].push_back(NULL); //为了下面处理btrees[i][j]时 i > j的边界情况
for(int k = 1; k <= n; k++)//k表示节点数目
for(int i = 1; i <= n-k+1; i++)//i表示起始节点
{
for(int rootval = i; rootval <= k+i-1; rootval++)
{//求[i,i+1,...i+k-1]序列对应的所有BST树
for(int m = 0; m < btrees[i][rootval-1].size(); m++)//左子树
for(int n = 0; n < btrees[rootval+1][k+i-1].size(); n++)//右子树
{
TreeNode *root = new TreeNode(rootval);
root->left = btrees[i][rootval-1][m];
root->right = btrees[rootval+1][k+i-1]
;
btrees[i][k+i-1].push_back(root);
}
}
}
return btrees[1]
;
}
};

【版权声明】转载请注明出处：/article/4879668.html