bucket sort

2022-06-27 07:01:14 阅读：199 来源： 互联网

标签：sort distance int workers bucket length bikes pair

1057. Campus Bikes Medium

On a campus represented on the X-Y plane, there are n workers and m bikes, with n <= m.

You are given an array workers of length n where workers[i] = [xi, yi] is the position of the ith worker. You are also given an array bikes of length m where bikes[j] = [xj, yj] is the position of the jth bike. All the given positions are unique.

Assign a bike to each worker. Among the available bikes and workers, we choose the (workeri, bikej) pair with the shortest Manhattan distance between each other and assign the bike to that worker.

If there are multiple (workeri, bikej) 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. Repeat this process until there are no available workers.

Return an array answer of length n, where answer[i] is the index (0-indexed) of the bike that the ith worker is assigned to.

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

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].

Constraints:

n == workers.length
m == bikes.length
1 <= n <= m <= 1000
workers[i].length == bikes[j].length == 2
0 <= xi, yi < 1000
0 <= xj, yj < 1000
All worker and bike locations are unique.

class Solution {
    public int[] assignBikes(int[][] workers, int[][] bikes) {
        //calculate all the distance between workers and bikes
        Map<Integer,List<Pair>> map = new HashMap();
        int mindis = Integer.MAX_VALUE;
        for(int i=0;i<workers.length;i++){
            for(int j=0;j<bikes.length;j++){
                int distance 
                    = Math.abs(workers[i][0]-bikes[j][0])+Math.abs(workers[i][1]-bikes[j][1]);
                List<Pair> list = map.getOrDefault(distance,new ArrayList());
                list.add(new Pair(i,j));
                map.put(distance,list);
                mindis = Math.min(mindis, distance);
            }
        }
        //get result from the bucket
        boolean[] status = new boolean[bikes.length];
        int count = 0;
        int[] result = new int[workers.length];
        Arrays.fill(result,-1);
        while(count!=result.length){
            if(!map.containsKey(mindis)){
                mindis++;
                continue;
            }
            for(Pair pair:map.get(mindis)){
                if(status[pair.val]){
                    continue;
                }
                else{
                    if(result[pair.key]==-1){
                        status[pair.val]=true;
                        result[pair.key]=pair.val;
                        count++;
                    }
                }
            }
            mindis++;
        }
        return result;
    }

}
class Pair{
    int key;
    int val;
    Pair(int key,int val){
        this.key = key;
        this.val = val;
    }
}

标签：sort,distance,int,workers,bucket,length,bikes,pair
来源： https://www.cnblogs.com/cynrjy/p/16414951.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

bucket sort