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/42626
🧭 풀이 시간
15분
👀 체감 난이도
✏️ 문제 설명
int 배열과 정수 K가 주어지고, 배열의 모든 수가 K 이상이도록 만들어야함. 제일 작은 수와 두번째로 작은 수를 규칙에 맞게 더해서 새로 int 배열에 넣음. 계속 반복해서 몇 번만에 모든 수가 K 이상이 되는지 리턴하기
🔍 풀이 방법
PriorityQueue 써서 peek가 K 이상이 될 때까지 제일 작은 수와 두번째 작은 수를 꺼내 연산한 뒤 배열에 넣는 것을 반복
⏳ 회고
너무 기본 문제임