class Solution {
public:
int numTrees(int n) {
int * v = new int[n + 1];
v[0] = 1;
v[1] = 1;
v[2] = 2;
for(int i = 3;i <= n;i ++){
v[i] = 0;//一定要初始化下!!!
for(int j = 0;j < i;j ++)
v[i] += v[j]*v[i - j - 1];
}
return v[n];
}
};
[LeetCode] Unique Binary Search Trees
最新推荐文章于 2020-02-29 22:29:24 发布