4024

Author: rimgosu

leetcode3/변지협/v2/4024. Nearest Available Drone.py

@@ -0,0 +1,18 @@
+class Solution:
+    def nearestDrone(self, drones: list[list[int]], target: list[int]) -> int:
+        lst = []
+        tx,ty = target
+
+        for x,y,r in drones:
+            distance = abs(x-tx) + abs(y-ty)
+            if distance <= r:
+                lst.append(distance)
+            else:
+                lst.append(99999)
+        
+        _min = min(lst)
+        
+        if _min == 99999:
+            return -1
+        else:
+            return lst.index(_min)