题目描述:
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
解题思路:
本题要我们求出整数n对应的BST的数量,我们用一个数组nums[]来储存,那么我们只需要得到nums[i]的公式:
nums[i] += nums[j-1] * nums[i-j],(j = 1,2,...,i)。
代码:
class Solution {
public:
int numTrees(int n) {
int *nums = new int[n+1];
nums[0] = nums[1] = 1;
for (int i = 2; i <= n; i++) {
nums[i] = 0;
for (int j = 1; j <= i; j++) {
nums[i] += nums[j-1] * nums[i-j];
}
}
return nums[n];
}
};