mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-09 03:59:38 +08:00
Update DynamicProgramming/MinimumSumPartition.java
Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
@ -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++){
|
||||||
|
Reference in New Issue
Block a user