github/leetcode-master
1
0
Fork 0
Code Issues Pull Requests Actions 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

2
problems/0416.分割等和子集.md
View File

@@ -155,7 +155,7 @@ dp[j]的数值一定是小于等于j的。
用例1，输入[1,5,11,5] 为例，如图：
![416.分割等和子集2](https://code-thinking-1253855093.file.myqcloud.com/pics/20210110104240545.png)
![416.分割等和子集2](https://file.kamacoder.com/pics/20210110104240545.png)
最后dp[11] == 11，说明可以将这个数组分割成两个子集，使得两个子集的元素和相等。