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
二叉树问题,首先还是用递归的思想,根节点不变,其他的变化可以看做是左子树和右子树的变化
例如,numTree(3)就相当于考虑三种情况,
(1)左子树节点数=2,右子树节点数=0,可能的结构数量=numTree(2)*numTree(0)
(2)左子树节点数=1,右子树节点数=1,可能的结构数量=numTree(1)*numTree(1)
(3)左子树节点数=0,右子树节点数=2,可能的结构数量=numTree(0)*numTree(2)
然后同理可求numTree(2)
当然这种问题在编程实现的时候优先选用迭代而不是递归
class Solution {
public:
int numTrees(int n) {
int *res = new int[n + 1];
res[0] = res[1] = 1;
for (int i = 2; i <= n; i++) {
int tmp = 0;
for (int k = 0; k < i; k++)
tmp += res[k] * res[i-k-1];
res[i] = tmp;
}
return res[n];
}
};