public class Solution {
public int numTrees(int n) {
int[] treeNums = new int[n+1];
treeNums[0] = 1;
treeNums[1] = 1;
for(int i=2; i<=n; i++){
for(int j=0; j<i; j++){
treeNums[i] += treeNums[j] * treeNums[i-j-1];
}
}
return treeNums[n];
}
}
Unique Binary Search Trees
最新推荐文章于 2021-09-15 15:18:50 发布