Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 86d6e932ab99 · 2020-09-06T16:53:52.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -32,16 +32,14 @@ public static int subSet(int[] arr) {
         }
 
         //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];
                 }
             }
         }

Original file line number	Diff line number	Diff line change
`@@ -32,16 +32,14 @@ public static int subSet(int[] arr) {`
`32`	`32`	`}`
`33`	`33`
`34`	`34`	`//fill dp array`
`35`		`- for(int i = 1; i <= n; i++){`
`36`		`- for(int j = 1; j <= sum; j++){`
`37`		`- if(arr[i-1] < j){`
`38`		`- dp[i][j] = dp[i-1][j - arr[i-1]] \|\| dp[i-1][j];`
`39`		`- }`
`40`		`- else if(arr[i-1] == j){`
	`35`	`+ for (int i = 1; i <= n; i++) {`
	`36`	`+ for (int j = 1; j <= sum; j++) {`
	`37`	`+ if (arr[i - 1] < j) {`
	`38`	`+ dp[i][j] = dp[i - 1][j - arr[i - 1]] \|\| dp[i - 1][j];`
	`39`	`+ } else if (arr[i - 1] == j) {`
`41`	`40`	`dp[i][j] = true;`
`42`		`- }`
`43`		`- else{`
`44`		`- dp[i][j] = dp[i-1][j];`
	`41`	`+ } else {`
	`42`	`+ dp[i][j] = dp[i - 1][j];`
`45`	`43`	`}`
`46`	`44`	`}`
`47`	`45`	`}`