class Solution {
public int numTrees(int n) {
int[] f = new int[n + 1];
f[0] = 1;
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= i; j ++) {
f[i] += f[j - 1] * f[i - j];
}
}
return f[n];
}
}
不同的二叉搜索树
最新推荐文章于 2023-01-31 18:10:07 发布