From 86d6e932ab99699d2adc87908eaf264489749a14 Mon Sep 17 00:00:00 2001 From: tribbleofjim <44364697+tribbleofjim@users.noreply.github.com> Date: Sun, 6 Sep 2020 16:53:52 +0800 Subject: [PATCH] Update DynamicProgramming/MinimumSumPartition.java Co-authored-by: Du Yuanchao --- DynamicProgramming/MinimumSumPartition.java | 16 +++++++--------- 1 file changed, 7 insertions(+), 9 deletions(-) diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java index 2108ecfb7..c40d8090f 100644 --- a/DynamicProgramming/MinimumSumPartition.java +++ b/DynamicProgramming/MinimumSumPartition.java @@ -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]; } } }