차도희 [WEEK6] #40
Open
차도희 [WEEK6] #40
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.
💻 코드 설명
다익스트라 알고리즘을 이용해서 최단거리를 각각 구한 후 K를 넘지 않는 마을의 수를 구했다.
🤔 체감 난이도
처음에는 인접행렬로 접근했다가 계속 채점 통과를 못 해서 구글링을 했다... 다익스트라 알고리즘 공부를 하긴 했었는데 오래 전이라 기억이 나지 않아 따로 공부를 했고, 구글링을 통해 우선순위 큐와 이와 관련된 comparator가 더 효율적이라는 사실을 깨닫고 찾아본 후 푸느라 시간이 오래 걸린 것 같다. 다익스트라 관련 문제를 더 풀어봐야겠다...
✨ 기타 사항 / 질문
커밋 이름이 week5로 오타가 났습니다 ! 그리고 왕지각 해버려서 정말 죄송합니다......😥