From 6db6a4c69a318b4ae9e79ae49d41f9ccc2918b9c Mon Sep 17 00:00:00 2001
From: nanhuaibeian <49868746+nanhuaibeian@users.noreply.github.com>
Date: Thu, 13 May 2021 09:48:45 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00096.=E4=B8=8D=E5=90=8C?=
 =?UTF-8?q?=E7=9A=84=E4=BA=8C=E5=8F=89=E6=90=9C=E7=B4=A2=E6=A0=91=20Java?=
 =?UTF-8?q?=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0096.不同的二叉搜索树.md | 1 -
 1 file changed, 1 deletion(-)

diff --git a/problems/0096.不同的二叉搜索树.md b/problems/0096.不同的二叉搜索树.md
index 98c993e4..7dea8fb0 100644
--- a/problems/0096.不同的二叉搜索树.md
+++ b/problems/0096.不同的二叉搜索树.md
@@ -173,7 +173,6 @@ class Solution {
         //初始化0个节点和1个节点的情况
         dp[0] = 1;
         dp[1] = 1;
-        //遍历
         for (int i = 2; i <= n; i++) {
             for (int j = 1; j <= i; j++) {
                 //对于第i个节点，需要考虑1作为根节点直到i作为根节点的情况，所以需要累加