mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-09 03:59:38 +08:00
Update DynamicProgramming/MinimumSumPartition.java
Co-authored-by: Du Yuanchao <shellhub.me@gmail.com>
This commit is contained in:
@ -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;
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user