From ff203d202f1454c5f7d6e640f40e667561b2e697 Mon Sep 17 00:00:00 2001 From: zzu <90972641+Zuhye@users.noreply.github.com> Date: Tue, 10 Nov 2026 22:49:23 +0900 Subject: [PATCH 1/2] 2498. Frog Jump II --- .../2498. Frog Jump II" | 21 +++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 "leetcode3/\354\206\241\354\243\274\355\230\234/2498. Frog Jump II" diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/2498. Frog Jump II" "b/leetcode3/\354\206\241\354\243\274\355\230\234/2498. Frog Jump II" new file mode 100644 index 00000000..7fd1f640 --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/2498. Frog Jump II" @@ -0,0 +1,21 @@ +class Solution: + def maxJump(self, stones: list[int]) -> int: + n = len(stones) + result = 0 + + front = stones[0::2] # 갈 때 + back = stones[1::2] # 올 때 + + if front[-1] != stones[-1]: + front.append(stones[-1]) + if back[-1] != stones[-1]: + back.append(stones[-1]) + back = [stones[0]] + back + + for i in range(1, len(front)): + result = max(result, front[i] - front[i-1]) + for i in range(1, len(back)): + result = max(result, back[i] - back[i-1]) + + + return result From b8246a771b608cb70a514654864874042a938374 Mon Sep 17 00:00:00 2001 From: zzu <90972641+Zuhye@users.noreply.github.com> Date: Tue, 10 Nov 2026 22:49:43 +0900 Subject: [PATCH 2/2] 1552. Magnetic Force Between Two Balls --- .../1552. Magnetic Force Between Two Balls" | 27 +++++++++++++++++++ 1 file changed, 27 insertions(+) create mode 100644 "leetcode3/\354\206\241\354\243\274\355\230\234/1552. Magnetic Force Between Two Balls" diff --git "a/leetcode3/\354\206\241\354\243\274\355\230\234/1552. Magnetic Force Between Two Balls" "b/leetcode3/\354\206\241\354\243\274\355\230\234/1552. Magnetic Force Between Two Balls" new file mode 100644 index 00000000..1d33b1dd --- /dev/null +++ "b/leetcode3/\354\206\241\354\243\274\355\230\234/1552. Magnetic Force Between Two Balls" @@ -0,0 +1,27 @@ +class Solution: + def maxDistance(self, position: list[int], m: int) -> int: + result = 0 + + position.sort() + + left = 1 + right = position[-1] - position[0] + + while left <= right: + mid = (left + right) // 2 + + cnt = 1 + latest = position[0] + + for i in position[1:]: + if mid <= i - latest: + cnt += 1 + latest = i + + if cnt >= m: + result = mid + left = mid + 1 + else: + right = mid -1 + + return result