添加0096.不同的二叉搜索树 Java版本
This commit is contained in:
parent
9bae5a96c0
commit
231baca72a
|
|
@ -173,7 +173,6 @@ class Solution {
|
||||||
//初始化0个节点和1个节点的情况
|
//初始化0个节点和1个节点的情况
|
||||||
dp[0] = 1;
|
dp[0] = 1;
|
||||||
dp[1] = 1;
|
dp[1] = 1;
|
||||||
//遍历
|
|
||||||
for (int i = 2; i <= n; i++) {
|
for (int i = 2; i <= n; i++) {
|
||||||
for (int j = 1; j <= i; j++) {
|
for (int j = 1; j <= i; j++) {
|
||||||
//对于第i个节点,需要考虑1作为根节点直到i作为根节点的情况,所以需要累加
|
//对于第i个节点,需要考虑1作为根节点直到i作为根节点的情况,所以需要累加
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue