Update DynamicProgramming/MinimumSumPartition.java

tribbleofjim · realDuYuanChao · web-flow · commit 928f212a4f15 · 2020-09-06T16:52:32.000+08:00
Co-authored-by: Du Yuanchao &lt;shellhub.me@gmail.com&gt;
diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java
@@ -69,13 +69,13 @@ public static int getSum(int arr[]){
         return sum;
     }
 
-    public static int getMin(int arr[], int sum){
-        if(arr.length <= 0){
+    public static int getMin(int[] arr, int sum) {
+        if (arr.length == 0) {
             return 0;
         }
         int min = Integer.MAX_VALUE;
-        for(int i = 0; i < arr.length; i++){
-            min = Math.min(min, (sum - 2*arr[i]));
+        for (int temp : arr) {
+            min = Math.min(min, sum - 2 * temp);
         }
         return min;
     }

Original file line number	Diff line number	Diff line change
`@@ -69,13 +69,13 @@ public static int getSum(int arr[]){`
`69`	`69`	`return sum;`
`70`	`70`	`}`
`71`	`71`
`72`		`- public static int getMin(int arr[], int sum){`
`73`		`- if(arr.length <= 0){`
	`72`	`+ public static int getMin(int[] arr, int sum) {`
	`73`	`+ if (arr.length == 0) {`
`74`	`74`	`return 0;`
`75`	`75`	`}`
`76`	`76`	`int min = Integer.MAX_VALUE;`
`77`		`- for(int i = 0; i < arr.length; i++){`
`78`		`- min = Math.min(min, (sum - 2*arr[i]));`
	`77`	`+ for (int temp : arr) {`
	`78`	`+ min = Math.min(min, sum - 2 * temp);`
`79`	`79`	`}`
`80`	`80`	`return min;`
`81`	`81`	`}`