CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

替换图片链接

Browse Source
This commit is contained in:
programmercarl
2025-03-17 15:52:23 +08:00
parent 91e7dab72c
commit 86a0208485
216 changed files with 813 additions and 813 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
problems/周总结/20210114动规周末总结.md
View File

@@ -31,7 +31,7 @@ for (int i = 1; i < m; i++) {
}
```
![62.不同路径1](https://code-thinking-1253855093.file.myqcloud.com/pics/20201209113631392-20230310133703294.png)
![62.不同路径1](https://file.kamacoder.com/pics/20201209113631392-20230310133703294.png)
## 周二
@@ -45,7 +45,7 @@ dp[i][j]定义依然是：表示从（0 ，0）出发，到(i, j) 有dp[i][j]条
如图：
![63.不同路径II](https://code-thinking-1253855093.file.myqcloud.com/pics/20210104114513928-20230310133707783.png)
![63.不同路径II](https://file.kamacoder.com/pics/20210104114513928-20230310133707783.png)
这里难住了不少同学，代码如下：
@@ -70,11 +70,11 @@ for (int i = 1; i < m; i++) {
拿示例1来举例如题：
![63.不同路径II1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210104114548983-20230310133711888.png)
![63.不同路径II1](https://file.kamacoder.com/pics/20210104114548983-20230310133711888.png)
对应的dp table 如图：
![63.不同路径II2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210104114610256-20230310133715981.png)
![63.不同路径II2](https://file.kamacoder.com/pics/20210104114610256-20230310133715981.png)
## 周三
@@ -111,7 +111,7 @@ for (int i = 3; i <= n ; i++) {
举例当n为10 的时候，dp数组里的数值，如下：
![343.整数拆分](https://code-thinking-1253855093.file.myqcloud.com/pics/20210104173021581-20230310133720552.png)
![343.整数拆分](https://file.kamacoder.com/pics/20210104173021581-20230310133720552.png)
@@ -143,7 +143,7 @@ dp数组如何初始化：只需要初始化dp[0]就可以了，推导的基础
n为5时候的dp数组状态如图：
![96.不同的二叉搜索树3](https://code-thinking-1253855093.file.myqcloud.com/pics/20210107093253987-20230310133724531.png)
![96.不同的二叉搜索树3](https://file.kamacoder.com/pics/20210107093253987-20230310133724531.png)
## 总结