Update DynamicProgramming/MinimumSumPartition.java

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

View File

@ -32,16 +32,14 @@ public class MinimumSumPartition
}
//fill dp array
for(int i = 1; i <= n; i++){
for(int j = 1; j <= sum; j++){
if(arr[i-1] < j){
dp[i][j] = dp[i-1][j - arr[i-1]] || dp[i-1][j];
}
else if(arr[i-1] == j){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= sum; j++) {
if (arr[i - 1] < j) {
dp[i][j] = dp[i - 1][j - arr[i - 1]] || dp[i - 1][j];
} else if (arr[i - 1] == j) {
dp[i][j] = true;
}
else{
dp[i][j] = dp[i-1][j];
} else {
dp[i][j] = dp[i - 1][j];
}
}
}