题目:
Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?
Example:
Input: 3 Output: 5 Explanation: 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
代码:
方法一(递归法):
class Solution {
public:
int numTrees(int n)
{
if(n<=1) return 1;
int sum=0;
for(int i=1;i<=n;++i)
sum+=numTrees(i-1)*numTrees(n-i);
return sum;
}
};
方法二(动态规划法):
class Solution {
public:
int numTrees(int n)
{
vector<int> sumNode(n+1,0);
sumNode[0]=1;
sumNode[1]=1;
for(int i=2;i<=n;++i)
for(int j=0;j<i;++j) //j符合条件时,最大为i-1,对照公式
sumNode[i]+=sumNode[j]*sumNode[i-j-1];
return sumNode[n];
}
};
想法:
和所学所知结合