mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
更新图片链接
This commit is contained in:
2
problems/1049.最后一块石头的重量II.md
Normal file → Executable file
2
problems/1049.最后一块石头的重量II.md
Normal file → Executable file
@@ -114,7 +114,7 @@ for (int i = 0; i < stones.size(); i++) { // 遍历物品
|
||||
|
||||
举例,输入:[2,4,1,1],此时target = (2 + 4 + 1 + 1)/2 = 4 ,dp数组状态图如下:
|
||||
|
||||

|
||||

|
||||
|
||||
|
||||
最后dp[target]里是容量为target的背包所能背的最大重量。
|
||||
|
||||
Reference in New Issue
Block a user