[김민제] Day29

leetcode3/김민제/3996. Even Number of Knight Moves.py

@@ -0,0 +1,9 @@
+class Solution:
+    def canReach(self, start: list[int], target: list[int]) -> bool:
+        start_parity = (start[0]+start[1])%2
+        target_paritiy = (target[0]+target[1])%2
+
+        if start_parity == target_paritiy:
+            return True
+        else:
+            return False

leetcode3/김민제/4024_Nearest_Available_Drone.py

@@ -0,0 +1,27 @@
+import sys
+
+class Solution:
+    def nearestDrone(self, drones: list[list[int]], target: list[int]) -> int:
+        answer = sys.maxsize
+        answer_arr = []
+        answer_i = []
+        for i,num in enumerate(drones):
+            temp = abs(num[0]-target[0])+abs(num[1]-target[1])
+            if temp <= num[2]:
+                answer = min(answer,temp)
+                answer_arr.append(answer)
+                answer_i.append(i)
+        if not answer_i:
+            return -1
+        else:
+            return answer_i[answer_arr.index(min(answer_arr))]
+
+
+drones = [[4,4,5]]
+target = [8,6]
+
+#drones = [[2,1,5],[4,4,5],[6,6,8]]
+#target = [5,5]
+
+solution = Solution()
+print(solution.nearestDrone(drones,target))

leetcode3/김민제/907_Sum_Minimums.py

@@ -0,0 +1,29 @@
+class Solution:
+    def sumSubarrayMins(self, arr: list[int]) -> int:
+        MOD = 10**9 + 7
+        n = len(arr)
+
+        left = [0] * n
+        right = [0] * n
+
+        stack = []
+
+        # 왼쪽에서 나보다 작은 값까지의 거리
+        for i in range(n):
+            while stack and arr[stack[-1]] > arr[i]:
+                stack.pop()
+
+            left[i] = i - stack[-1] if stack else i + 1
+            stack.append(i)
+
+        stack = []
+
+        # 오른쪽에서 나보다 작거나 같은 값까지의 거리
+        for i in range(n - 1, -1, -1):
+            while stack and arr[stack[-1]] >= arr[i]:
+                stack.pop()
+
+            right[i] = stack[-1] - i if stack else n - i
+            stack.append(i)
+
+        return sum(arr[i] * left[i] * right[i] for i in range(n)) % MOD