01背包中 题号0494 目标和,修改Java版代码问题
This commit is contained in:
parent
301026babd
commit
b1ca98e30b
|
|
@ -248,6 +248,7 @@ class Solution {
|
||||||
for (int i = 0; i < nums.length; i++) sum += nums[i];
|
for (int i = 0; i < nums.length; i++) sum += nums[i];
|
||||||
if ((target + sum) % 2 != 0) return 0;
|
if ((target + sum) % 2 != 0) return 0;
|
||||||
int size = (target + sum) / 2;
|
int size = (target + sum) / 2;
|
||||||
|
if(size < 0) size = -size;
|
||||||
int[] dp = new int[size + 1];
|
int[] dp = new int[size + 1];
|
||||||
dp[0] = 1;
|
dp[0] = 1;
|
||||||
for (int i = 0; i < nums.length; i++) {
|
for (int i = 0; i < nums.length; i++) {
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue