Update DynamicProgramming/MinimumSumPartition.java

Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
tribbleofjim
2020-09-06 16:53:17 +08:00
committed by GitHub
parent e27175bc10
commit 6fdd9c90da

View File

@ -24,7 +24,7 @@ public class MinimumSumPartition
int n = arr.length; int n = arr.length;
int sum = getSum(arr); int sum = getSum(arr);
boolean[][] dp = new boolean[n + 1][sum + 1]; boolean[][] dp = new boolean[n + 1][sum + 1];
for(int i = 0; i < n; i++){ for (int i = 0; i <= n; i++) {
dp[i][0] = true; dp[i][0] = true;
} }
for(int j = 0; j < sum; j++){ for(int j = 0; j < sum; j++){