Update DynamicProgramming/MinimumSumPartition.java

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

View File

@ -49,8 +49,8 @@ public class MinimumSumPartition
// fill the index array
int index[] = new int[sum];
int p = 0;
for(int i = 0; i <= sum / 2; i++){
if(dp[n][i]){
for (int i = 0; i <= sum / 2; i++) {
if (dp[n][i]) {
index[p++] = i;
}
}