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.
🧷 문제 링크
주난의 난
🧭 풀이 시간
10분
👀 체감 난이도
✏️ 문제 설명
주난이가 한 번 점프하면 친구 한 겹을 쓰러트릴 수 있음
초코바를 훔쳐간 친구에 도달하기까지 몇 번 점프 해야할까?
🔍 풀이 방법
0-1 BFS
⏳ 회고
가중치가 0 또는 1이라 재방문 했을 때 더 짧은 경로로 도달할 수 있어서
dist배열을 둬야 하고 그래서 다익스트라 태그도 들어가는 것