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
1 participant
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/340212
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
순서대로 n개의 퍼즐을 제한 시간 내에 풀어야 할 때, 제한 시간 내에 퍼즐을 모두 해결하기 위한 숙련도의 최솟값 구하기
🔍 풀이 방법
이분탐색 사용
limit보다 적은 시간이 걸리면 end=mid 시키고,
limit 초과면 start=mid+1 시켜줌
⏳ 회고
기본적 이분탐색이다