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

Update 1049.最后一块石头的重量II.md

Browse Source 
添加1049.最后一块石头的重量 Java版本
This commit is contained in:
nanhuaibeian
2021-05-12 16:56:05 +08:00
committed by GitHub
parent 346b0713d8
commit a1d15df5e0
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/1049.最后一块石头的重量II.md
View File

@ -166,7 +166,7 @@ class Solution {
//初始化dp数组 //初始化dp数组
int[] dp = new int[target + 1]; int[] dp = new int[target + 1];
for (int i = 0; i < stones.length; i++) { for (int i = 0; i < stones.length; i++) {
//采用倒叙 //采用倒序
for (int j = target; j >= stones[i]; j--) { for (int j = target; j >= stones[i]; j--) {
//两种情况，要么放，要么不放 //两种情况，要么放，要么不放
dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]); dp[j] = Math.max(dp[j], dp[j - stones[i]] + stones[i]);