-
Notifications
You must be signed in to change notification settings - Fork 0
/
findKClosestElems.java
43 lines (32 loc) · 1.17 KB
/
findKClosestElems.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
/*
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If there is a tie, the smaller elements are always preferred.
Example 1:
Input: [1,2,3,4,5], k=4, x=3
Output: [1,2,3,4]
Example 2:
Input: [1,2,3,4,5], k=4, x=-1
Output: [1,2,3,4]
Note:
The value k is positive and will always be smaller than the length of the sorted array.
Length of the given array is positive and will not exceed 104
Absolute value of elements in the array and x will not exceed 104
*/
class Solution1 {
public List<Integer> findClosestK(int [] num, int k, int x){
List<Integer> results = new ArrayList<>();
PriorityQueue<Integer> pq = new PriorityQueue<>(new Comparator<Integer>() {
@Override
public int compare(Integer o1, Integer o2) { //order by how far elem is from x
return Math.abs(o1 - x) - Math.abs(o2-x);
}
});
for (int temp : num){
pq.add(temp);
}
for (int temp : pq){
results.add(pq.poll());
}
Collections.sort(results);
return results.subList(0,k);
}
}