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