-
Notifications
You must be signed in to change notification settings - Fork 56
/
Solution.java
44 lines (40 loc) · 1.25 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
package g1201_1300.s1300_sum_of_mutated_array_closest_to_target;
// #Medium #Array #Sorting #Binary_Search #Binary_Search_II_Day_16
// #2022_03_08_Time_7_ms_(33.33%)_Space_47.5_MB_(28.89%)
import java.util.Arrays;
public class Solution {
public int findBestValue(int[] arr, int target) {
Arrays.sort(arr);
int n = arr.length;
int lo = 0;
int hi = arr[n - 1];
int min = Integer.MAX_VALUE;
int ans = -1;
while (lo <= hi) {
int mid = (lo + hi) / 2;
int m = check(mid, arr, target);
int l = check(mid - 1, arr, target);
int r = check(mid + 1, arr, target);
if (m < min || (m == min && ans > mid)) {
min = m;
ans = mid;
} else if (l <= r) {
hi = mid - 1;
} else {
lo = mid + 1;
}
}
return ans;
}
public int check(int v, int[] arr, int target) {
int sum = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] >= v) {
return Math.abs(sum + (arr.length - i) * v - target);
} else {
sum += arr[i];
}
}
return Math.abs(sum - target);
}
}