2024-03-10

tgyuuAn/README.md

@@ -42,4 +42,5 @@
 | 38차시 | 2023.02.15 |  DP  | <a href="https://www.acmicpc.net/problem/2749">피보나치 수 3</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/137
 | 39차시 | 2023.02.18 |  DP  | <a href="https://www.acmicpc.net/problem/7579">앱</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/139
 | 40차시 | 2023.02.21 |  DP  | <a href="https://www.acmicpc.net/problem/31413">입대</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/142
+| 42차시 | 2024.03.10 |  이분 탐색  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64062">징검다리 건너기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/157
 ---

tgyuuAn/이분 탐색/징검다리 건너기.py

@@ -0,0 +1,25 @@
+def check(mid, stones, k):
+    gap = 0
+    for stone in stones:
+        if stone - mid < 0: gap += 1
+        else: gap = 0
+
+        if gap >= k: return False
+    return True
+
+def solution(stones, k):
+    left = -1
+    right = 200000001
+    answer = 0
+
+    while left+1<right:
+        mid = (left+right)//2
+
+        if check(mid, stones, k): # mid 명이 건널 수 있을 경우 건너는 수를 더 늘림
+            left = mid
+            answer = mid
+
+        else:
+            right = mid
+
+    return answer