From bfcf82f972ed422150e8d2d66eae4f1f5a13bbb4 Mon Sep 17 00:00:00 2001 From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com> Date: Tue, 10 Nov 2026 22:30:19 +0900 Subject: [PATCH 1/2] Create 2498. Frog Jump II --- .../2498. Frog Jump II" | 31 +++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/2498. Frog Jump II" diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/2498. Frog Jump II" "b/leetcode3/\354\265\234\354\233\220\354\244\200/2498. Frog Jump II" new file mode 100644 index 00000000..689fa919 --- /dev/null +++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/2498. Frog Jump II" @@ -0,0 +1,31 @@ +# + +''' +1. 아이디어 : +다음돌을 건너뛰면서 그 다음돌만 밟으면서 뛰면 거리를 최소화 할 수 있습니다 + +2. 시간복잡도 : + O(n) + +3. 자료구조/알고리즘 : +그리디 + +''' +class Solution: + def maxJump(self, stones: list[int]) -> int: + n = len(stones) + + odd_max = 0 + even_max = 0 + ans = max(stones[1]-stones[0], stones[-1] - stones[-2]) + + for i in range(0, n-2, 2): + even_max = max(even_max, stones[i+2] - stones[i]) + # print(stones[i+2], stones[i]) + + for i in range(1, n-2, 2): + odd_max = max(odd_max, stones[i+2] - stones[i]) + # print(stones[i+2], stones[i]) + + return max(ans, even_max, odd_max) + From 158e945397bd4e441a0dff6810d21e670a84ea59 Mon Sep 17 00:00:00 2001 From: Won Joon Thomas Choi <113500771+724thomas@users.noreply.github.com> Date: Tue, 10 Nov 2026 22:30:31 +0900 Subject: [PATCH 2/2] Create 1552. Magnetic Force Between Two Balls.py --- ...1552. Magnetic Force Between Two Balls.py" | 52 +++++++++++++++++++ 1 file changed, 52 insertions(+) create mode 100644 "leetcode3/\354\265\234\354\233\220\354\244\200/1552. Magnetic Force Between Two Balls.py" diff --git "a/leetcode3/\354\265\234\354\233\220\354\244\200/1552. Magnetic Force Between Two Balls.py" "b/leetcode3/\354\265\234\354\233\220\354\244\200/1552. Magnetic Force Between Two Balls.py" new file mode 100644 index 00000000..99cab38f --- /dev/null +++ "b/leetcode3/\354\265\234\354\233\220\354\244\200/1552. Magnetic Force Between Two Balls.py" @@ -0,0 +1,52 @@ +# + +''' +1. 아이디어 : +최소 떨어져있는 거리와 최대 떨어져있는 거리를 구합니다. (가장 높은 - 가장 낮은 위치) // m +이분탐색을 통해 거리들을 선정하고, + +공을 거리만큼 띄워서 위치시키는게 가능한지 검토합니다. +안된다면 공 사이 거리가 너무 먼거고, +된다면 공 사이 거리가 너무 가깝습니다. + +2. 시간복잡도 : + O(nlogn) + +3. 자료구조/알고리즘 : +이분탐색 + +''' +class Solution: + def maxDistance(self, position: list[int], m: int) -> int: + n = len(position) + position.sort() + + def is_possible(distance): + count = 1 + prev = position[0] + + for pos in position[1:]: + if pos - prev >= distance: + count += 1 + prev = pos + + if count >= m: + return True + + return False + + left = 1 + right = (position[-1] - position[0]) // (m-1) + + ans = 0 + + while left <= right: + mid = (left + right) // 2 + + if is_possible(mid): + ans = mid + left = mid + 1 + else: + right = mid - 1 + + return ans