Update DynamicProgramming/MinimumSumPartition.java

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

View File

@ -69,13 +69,13 @@ public class MinimumSumPartition
return sum; return sum;
} }
public static int getMin(int arr[], int sum){ public static int getMin(int[] arr, int sum) {
if(arr.length <= 0){ if (arr.length == 0) {
return 0; return 0;
} }
int min = Integer.MAX_VALUE; int min = Integer.MAX_VALUE;
for(int i = 0; i < arr.length; i++){ for (int temp : arr) {
min = Math.min(min, (sum - 2*arr[i])); min = Math.min(min, sum - 2 * temp);
} }
return min; return min;
} }