You are given a 2D integer array drones, where drones[i] = [xi, yi, rangei] represents the x-coordinate, y-coordinate, and travel range of the ith drone.
You are also given an integer array target = [tx, ty], representing the coordinates of the target.
A drone drones[i] can reach the target if the Manhattan distance between its coordinates and the target coordinates is less than or equal to its rangei.
Return the index of the reachable drone with the minimum Manhattan distance to the target. If there is a tie, return the smallest index. If no drone can reach the target, return -1.
Example 1:
Input: drones = [[0,0,8],[2,2,9]], target = [3,4]
Output: 1
Explanation:
drones[0] and target is |0 - 3| + |0 - 4| = 7, which is within its range of 8.drones[1] and target is |2 - 3| + |2 - 4| = 3, which is within its range of 9.drones[1] is the nearest drone, the answer is 1.Example 2:
Input: drones = [[2,1,5],[4,4,5],[6,6,8]], target = [5,5]
Output: 1
Explanation:
drones[0] and target is |2 - 5| + |1 - 5| = 7, which is greater than its range of 5.drones[1] and target is |4 - 5| + |4 - 5| = 2, which is within its range of 5.drones[2] and target is |6 - 5| + |6 - 5| = 2, which is within its range of 8.drones[1] and drones[2] are the nearest drones. Since we should return the smallest index, the answer is 1.Example 3:
Input: drones = [[4,4,5]], target = [8,6]
Output: -1
Explanation:
drones[0] and target is |4 - 8| + |4 - 6| = 6, which is greater than its range of 5.Constraints:
1 <= drones.length <= 100drones[i] = [xi, yi, rangei]target = [tx, ty]-25 <= xi, yi, tx, ty <= 251 <= rangei <= 100For each drone, compute its Manhattan distance to target and check whether it is at most the drone's range.
Among all reachable drones, keep the one with the smallest distance. If two distances are equal, keep the smaller index.
[[0,0,8],[2,2,9]] [3,4]
[[2,1,5],[4,4,5],[6,6,8]] [5,5]
[[4,4,5]] [8,6]