Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://school.programmers.co.kr/learn/courses/30/lessons/64062
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
징검다리의 디딤돌에는 모두 숫자가 적혀 있으며, 한 번 밟을 때마다 1씩 줄어들음
숫자가 0이 되면 더 이상 밟을 수 없음
한 번에 건너뛸 수 있는 디딤돌의 최대 칸수 k가 주어질 때, 최대 몇 명까지 징검다리 건널 수 있는지 구하기
🔍 풀이 방법
이분탐색 사용
임의의 값 mid를 설정해서 해당 수만큼의 인원이 건널 수 있는지 여부를 판단해서
k 이상이 건너면 end = mid - 1로 줄이고 그 미만이 건너면 start = mid + 1로 갱신
⏳ 회고
전형적인 이분탐색이다.