algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 23:28:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: 修改中文单词冗余

Browse Source
This commit is contained in:
lllyt8
2024-11-17 23:30:11 -08:00
committed by GitHub
parent 43face81bb
commit 6901cb345e
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0647.回文子串.md
View File

@ -102,7 +102,7 @@ dp[i][j]可以初始化为true么？ 当然不行，怎能刚开始就全都匹
4. 确定遍历顺序 4. 确定遍历顺序
遍历顺序可有有点讲究了。 遍历顺序可就有点讲究了。
首先从递推公式中可以看出，情况三是根据dp[i + 1][j - 1]是否为true，在对dp[i][j]进行赋值true的。 首先从递推公式中可以看出，情况三是根据dp[i + 1][j - 1]是否为true，在对dp[i][j]进行赋值true的。