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/12979
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
기지국을 n개 범위를 모두 커버할 수 있도록 추가로 설치할거임.
현재 기지국이 설치되어있는 위치가 주어지고 커버하지 못하는 위치를 최소 개수의 추가 기지국으로 설치할때,
추가되는 기지국의 개수를 출력.
🔍 풀이 방법
구현
설치되어있는 기지국을 순차적으로 탐색하면서 커버되지 못하는 부분을 처리
⏳ 회고
ez