Skip to content

Commit c9be593

Browse files
Merge pull request #2789 from sumit16sharma/main-1
Create 2616-minimize-the-maximum-difference-of-pairs.java
2 parents c57dce9 + 8c9401a commit c9be593

File tree

1 file changed

+38
-0
lines changed

1 file changed

+38
-0
lines changed
+38
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
class Solution {
2+
public int minimizeMax(int[] nums, int p) {
3+
Arrays.sort(nums);
4+
5+
int s = 0;
6+
int e = nums[nums.length -1];
7+
int res = Integer.MAX_VALUE;
8+
9+
while(s <= e) {
10+
int mid = s + (e-s)/2;
11+
12+
if(isPossible(nums, mid, p)) {
13+
res = mid;
14+
e = mid - 1;
15+
} else {
16+
s = mid + 1;
17+
}
18+
}
19+
20+
return res;
21+
}
22+
23+
public boolean isPossible(int[] arr, int maxDiff, int pairs) {
24+
int count = 0;
25+
int i = 0;
26+
27+
while(i < arr.length - 1) {
28+
if(Math.abs(arr[i] - arr[i+1]) <= maxDiff) {
29+
count++;
30+
i += 2;
31+
} else {
32+
i++;
33+
}
34+
}
35+
36+
return count >= pairs;
37+
}
38+
}

0 commit comments

Comments
 (0)