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