From b2d267c1599756ac5d9ccc57c1090faa38f524b8 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EC=97=BC=ED=98=9C=EC=A0=95?=
 <122238744+cyzlcyzl@users.noreply.github.com>
Date: Thu, 27 Aug 2026 22:39:48 +0900
Subject: [PATCH] Create 4024. Nearest Available Drone.java

---
 .../4024. Nearest Available Drone.java"       | 20 +++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 "leetcode3/\354\227\274\355\230\234\354\240\225/4024. Nearest Available Drone.java"

diff --git "a/leetcode3/\354\227\274\355\230\234\354\240\225/4024. Nearest Available Drone.java" "b/leetcode3/\354\227\274\355\230\234\354\240\225/4024. Nearest Available Drone.java"
new file mode 100644
index 00000000..80416a32
--- /dev/null
+++ "b/leetcode3/\354\227\274\355\230\234\354\240\225/4024. Nearest Available Drone.java"	
@@ -0,0 +1,20 @@
+// O(3n)
+
+class Solution {
+    public int nearestDrone(int[][] drones, int[] target) {
+        int x = target[0];
+        int y = target[1];
+        int min = Integer.MAX_VALUE;
+        int idx = 0;
+        for (int i = 0; i<drones.length; i++) {
+            int md = Math.abs(drones[i][0]-x) + Math.abs(drones[i][1]-y);
+            if (md > drones[i][2]) continue;
+            if (md < min) {
+                min = md;
+                idx = i;
+            }
+        }
+        if (min == Integer.MAX_VALUE) return -1;
+        return idx;
+    }
+}