LeetCode 1057. Campus Bikes (Medium)

Description

On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid.

Our goal is to assign a bike to each worker. Among the available bikes and workers, we choose the (worker, bike) pair with the shortest Manhattan distance between each other, and assign the bike to that worker. (If there are multiple (worker, bike) pairs with the same shortest Manhattan distance, we choose the pair with the smallest worker index; if there are multiple ways to do that, we choose the pair with the smallest bike index). We repeat this process until there are no available workers.

The Manhattan distance between two points p1and p2is Manhattan(p1, p2) = |p1.x - p2.x| + |p1.y - p2.y|.

Return a vector ansof length N,where ans[i]is the index (0-indexed) of the bike that the i-th worker is assigned to.

Example 1:

Input: workers = [[0,0],[2,1]], bikes = [[1,2],[3,3]]
Output: [1,0]
Explanation:
Worker 1 grabs Bike 0 as they are closest (without ties), and Worker 0 is assigned Bike 1. So the output is [1, 0].

Example 2:

Input: workers = [[0,0],[1,1],[2,0]], bikes = [[1,0],[2,2],[2,1]]
Output: [0,2,1]
Explanation: 
Worker 0 grabs Bike 0 at first. Worker 1 and Worker 2 share the same distance to Bike 2, thus Worker 1 is assigned to Bike 2, and Worker 2 will take Bike 1. So the output is [0,2,1].

Note:

1. 0 <= workers[i][j], bikes[i][j] < 1000
2. All worker and bike locations are distinct.
3. 1 <= workers.length <= bikes.length <= 1000

---

Analysis:

1. Create a class named Pair which has 3 member variables, Manhattan distance, workerId and bikeId, representing each worker-bike pair.
2. Create a Priority Queue used to store Pair objects whose its priority is sorted by Manhattan distance, workerId and bikeId in turn.
3. For each worker and each bike, calculate the Manhattan distance between them, create a Pair object and put the Pair object into the priority queue.
4. Assign the bikes to the workers.

---

class Solution {
    public int[] assignBikes(int[][] workers, int[][] bikes) {
        int M = workers.length;
        int N = bikes.length;
        
        // Initialize a priority queue.
        PriorityQueue<Pair> q = new PriorityQueue<>((p1, p2) -> {
            if(p1.getDistance() == p2.getDistance()) {
                if(p1.getWorkerId() == p2.getWorkerId()) {
                    return p1.getBikeId() - p2.getBikeId();
                }else{
                    return p1.getWorkerId() - p2.getWorkerId();
                }
            }else{
                return p1.getDistance() - p2.getDistance();
            }
        });
        
        // For each worker and each bike, calc the Manhattan distance between them, create a pair object and put the pair object into the priority queue.
        for(int i = 0; i < M; i++) {
            for(int j = 0; j < N; j++) {
                int distance = calcDistance(workers[i][0], bikes[j][0], workers[i][1], bikes[j][1]); // Calc the Manhattan distance.
                Pair pair = new Pair(distance, i, j);
                q.offer(pair);
            }
        }
        
        int count = 0;
        int[] res = new int[M];
        boolean[] workersAssigned = new boolean[M];
        boolean[] bikesAssigned = new boolean[N];
        
        // Assign the bike to the worker.
        while(count < M) {
            Pair pair = q.poll();
            int workerId = pair.getWorkerId();
            int bikeId = pair.getBikeId();
            if(!workersAssigned[workerId] && !bikesAssigned[bikeId]) {
                res[workerId] = bikeId;
                workersAssigned[workerId] = true;
                bikesAssigned[bikeId] = true;
                count++;
            }
        }
        return res;
    }
    
    public int calcDistance(int x1, int x2, int y1, int y2) {
        return Math.abs(x1-x2) + Math.abs(y1-y2);
    }
}

class Pair {
    private int distance;
    private int workerId;
    private int bikeId;
    
    public Pair(int distance, int workerId, int bikeId) {
        this.distance = distance;
        this.workerId = workerId;
        this.bikeId = bikeId;
    }
    
    public int getDistance() {
        return distance;
    }
    
    public int getWorkerId() {
        return workerId;
    }
    
    public int getBikeId() {
        return bikeId;
    }
}