mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
修改 0096.不同的二叉搜索树.md C语言解法注释错别字
This commit is contained in:
@ -247,7 +247,7 @@ int numTrees(int n){
|
|||||||
int i, j;
|
int i, j;
|
||||||
for(i = 1; i <= n; ++i) {
|
for(i = 1; i <= n; ++i) {
|
||||||
for(j = 1; j <= i; ++j) {
|
for(j = 1; j <= i; ++j) {
|
||||||
//递推公式:dp[i] = d[i] + 根为j时左子树种类个数 * 根为j时右子树种类个数
|
//递推公式:dp[i] = dp[i] + 根为j时左子树种类个数 * 根为j时右子树种类个数
|
||||||
dp[i] += dp[j - 1] * dp[i - j];
|
dp[i] += dp[j - 1] * dp[i - j];
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user