LeetCode 1057. Campus Bikes

Posted Dylan_Java_NYC

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 1057. Campus Bikes相关的知识,希望对你有一定的参考价值。

原题链接在这里:https://leetcode.com/problems/campus-bikes/

题目:

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 p1 and p2 is Manhattan(p1, p2) = |p1.x - p2.x| + |p1.y - p2.y|.

Return a vector ans of 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

题解:

The question is asking to sort the pair by distance. If distance is the same, sort by worker index. If worker index is the same, sort by bike index.

Thus we could have a minHeap. And add each pair.

When polling out a pair, check if worker has been visited or bike has been visited. If yes, then it must have a smaller pair before.

Otherwise, assign this bike to this user and mark both visited.

Time Complexity: O(m*n*log(m*n)). m = worders.length. n = bikes.length.

Space: O(m + n).

AC Java:

 1 class Solution {
 2     public int[] assignBikes(int[][] workers, int[][] bikes) {
 3         int m = workers.length;
 4         int n = bikes.length;
 5         int [] res = new int[m];
 6         
 7         boolean [] wUsed = new boolean[m];
 8         boolean [] bUsed = new boolean[n];
 9         
10         PriorityQueue<int []> minHeap = new PriorityQueue<>((a, b) -> a[2] == b[2] ? (a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]) : a[2] - b[2]);
11         for(int i = 0; i < m; i++){
12             for(int j = 0; j < n; j++){
13                 minHeap.add(new int[]{i, j, dist(workers[i], bikes[j])});
14             }
15         }
16         
17         while(!minHeap.isEmpty()){
18             int [] cur = minHeap.poll();
19             if(wUsed[cur[0]] || bUsed[cur[1]]){
20                 continue;
21             }
22             
23             res[cur[0]] = cur[1];
24             wUsed[cur[0]] = true;
25             bUsed[cur[1]] = true;
26         }
27         
28         return res;
29     }
30     
31     private int dist(int [] a, int [] b){
32         return Math.abs(a[0] - b[0]) + Math.abs(a[1] - b[1]);
33     }
34 }

以上是关于LeetCode 1057. Campus Bikes的主要内容,如果未能解决你的问题,请参考以下文章

[LC] 1057. Campus Bikes

Campus Bikes

LeetCode 1066. Campus Bikes II

LeetCode 1066. Campus Bikes II

使用 OpenGL API 播放 BIK 视频

Vijos 1057 盖房子