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

10
problems/周总结/20210225动规周末总结.md
View File

@@ -30,7 +30,7 @@ dp[1] = max(nums[0], nums[1]);
以示例二，输入[2,7,9,3,1]为例。
![198.打家劫舍](https://code-thinking-1253855093.file.myqcloud.com/pics/20210221170954115-20230310133425353.jpg)
![198.打家劫舍](https://file.kamacoder.com/pics/20210221170954115-20230310133425353.jpg)
红框dp[nums.size() - 1]为结果。
@@ -42,15 +42,15 @@ dp[1] = max(nums[0], nums[1]);
* 情况一：考虑不包含首尾元素
![213.打家劫舍II](https://code-thinking-1253855093.file.myqcloud.com/pics/20210129160748643.jpg)
![213.打家劫舍II](https://file.kamacoder.com/pics/20210129160748643.jpg)
* 情况二：考虑包含首元素，不包含尾元素
![213.打家劫舍II1](https://code-thinking-1253855093.file.myqcloud.com/pics/20210129160821374.jpg)
![213.打家劫舍II1](https://file.kamacoder.com/pics/20210129160821374.jpg)
* 情况三：考虑包含尾元素，不包含首元素
![213.打家劫舍II2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210129160842491.jpg)
![213.打家劫舍II2](https://file.kamacoder.com/pics/20210129160842491.jpg)
需要注意的是，**“考虑” 不等于 “偷”**，例如情况三，虽然是考虑包含尾元素，但不一定要选尾部元素！对于情况三，取nums[1] 和 nums[3]就是最大的。
@@ -178,7 +178,7 @@ return {val2, val1};
以示例1为例，dp数组状态如下：（**注意用后序遍历的方式推导**）
![337.打家劫舍III](https://code-thinking-1253855093.file.myqcloud.com/pics/20210129181331613.jpg)
![337.打家劫舍III](https://file.kamacoder.com/pics/20210129181331613.jpg)
**最后头结点就是 取下标0 和 下标1的最大值就是偷得的最大金钱**。