parent
a77c7cc160
commit
ab034dc3a0
|
|
@ -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]);
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue