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
这道题的思路是找规律
f(0) = 1
f(1) = f(0) * f(0)
f(2) = f(0) * f(1) + f(1) * f(0) //分别对应1在根部,那么左边有0个数,右边有1个数;2在根部,那么左边有1个数,右边有0个数
一次类推,使用动规
代码:
public int numTrees(int n) {
int [] f = new int[n+1];
f[0] = 1;
for(int i=1;i<=n;i++){
for(int j=0;j<i;j++){
f[i] += f[j] * f[i-j-1];
}
}
return f[n];
}