[20250805] BOJ / G5 / 수 고르기 / 이강현 #611
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
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://www.acmicpc.net/problem/2230
🧭 풀이 시간
30분
👀 체감 난이도
✏️ 문제 설명
배열에서 두 수를 골랐을 때, M이상이 되는 최솟값을 출력.
🔍 풀이 방법
투 포인터
인덱스 0부터 시작해서 M보다 커지면 left++, 아니면 right++
⏳ 회고
투 포인터라고 하면 자꾸 좌우에서 와야한다는 고정관념이 있어가지고, 자꾸 헷갈린다.
나는 바보야