1057. Campus Bikes

In a logistics company, there are several warehouses and delivery trucks. Each warehouse has a specific location, and each truck has a designated parking spot. The company wants to assign trucks to warehouses in a way that minimizes the maximum distance between any warehouse and its assigned truck. The distance between a warehouse at (x1, y1) and a truck at (x2, y2) is calculated as |x1 - x2| + |y1 - y2|. Assign trucks to warehouses such that each truck is assigned to at most one warehouse, and return an array where each element represents the index of the truck assigned to the corresponding warehouse.

Examples
Input: [[[0,0],[2,1]],[[1,2],[3,3]]]
Output: [1,0]
Hints
Related Problems

1057. Campus Bikes

In a logistics company, there are several warehouses and delivery trucks. Each warehouse has a specific location, and each truck has a designated parking spot. The company wants to assign trucks to warehouses in a way that minimizes the maximum distance between any warehouse and its assigned truck. The distance between a warehouse at (x1, y1) and a truck at (x2, y2) is calculated as |x1 - x2| + |y1 - y2|. Assign trucks to warehouses such that each truck is assigned to at most one warehouse, and return an array where each element represents the index of the truck assigned to the corresponding warehouse.