public class Solution {
public int numTrees(int n) {
if (n == 1)
return 1;
if (n == 2)
return 2;
int[] record = new int[n + 1];
record[0] = 1;
record[1] = 1;
record[2] = 2;
for (int i = 3; i <= n; i++) {
int tmp = 0;
for (int k = 0; k < i; k++) {
tmp += (record[k] * record[i - k - 1]);
}
record[i] = tmp;
}
return record[n];
}
}
n = 0呢???
Unique Binary Search Trees
最新推荐文章于 2022-07-16 08:33:08 发布