-
Notifications
You must be signed in to change notification settings - Fork 0
/
Nearby_cars.java
54 lines (43 loc) · 1.32 KB
/
Nearby_cars.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
45
46
47
48
49
50
51
52
53
54
package Heaps;
import java.util.PriorityQueue;
public class Nearby_cars {
public static class Points implements Comparable<Points> {
int x;
int y;
int distSq;
int indx;
public Points(int x, int y, int distSq, int indx) {
this.x = x;
this.y = y;
this.distSq = distSq;
this.indx = indx;
}
@Override
public int compareTo(Points p2){
return this.distSq - p2.distSq; //ascending order
}
}
public static void findNearbyCars(int[][] points, int k){
PriorityQueue<Points> pq = new PriorityQueue<>();
int x, y, dist;
for (int i=0; i<points.length; i++){
x = points[i][0];
y = points[i][1];
dist = (int)Math.pow(x, 2) + (int)Math.pow(y, 2) ;
pq.add(new Points(x, y, dist, i));
}
// printing k elements
for (int i=0; i<k; i++){
System.out.println("C-" + pq.peek().indx + " Distance " + pq.peek().distSq);
pq.remove();
}
}
public static void main(String[] args) {
int[][] points = {
{3,2},
{5, -1},
{-2, 4}
};
findNearbyCars(points, 2);
}
}