Day29

Author: choifi

leetcode3/최민지/4024.py

@@ -0,0 +1,20 @@
+class Solution:
+    def nearestDrone(self, drones: list[list[int]], target: list[int]) -> int:
+        result = []
+        for drone in drones:
+            s = drone[0]
+            e = drone[1]
+            r = drone[2]
+            temp = abs(s - target[0]) + abs(e - target[1])
+            if  temp <= r:
+                result.append(temp)
+            else: 
+                result.append(100)
+        
+
+        output = min(result)
+        if output != 100:
+            return result.index(output)
+        else:
+            return -1
+            

leetcode3/최민지/907.py

@@ -0,0 +1,9 @@
+class Solution:
+    def sumSubarrayMins(self, arr: List[int]) -> int:
+        result = []
+        for i in range(1, len(arr)+1):
+            for j in range(0, i):
+                temp = arr[j:j+i]
+                result.append(min(temp))
+        return sum(result) % ( 10**9 + 7 )
+