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/43164
🧭 풀이 시간
40분
👀 체감 난이도
✏️ 문제 설명
주어진 항공권을 모두 사용해서 여행할 수 있는 경로 반환하기. 그런데 이제 ICN에서 시작하고, 가능한 경로가 2개 이상이면 알파벳 순서가 앞서는 거 반환
🔍 풀이 방법
항공권 알파벳 순으로 나열해두고 dfs+백트래킹
⏳ 회고
리스트를 배열로 바꾸는 거 모르겠어서 찾아봄 toArray(new String[0])하면 알아서 필요한 크기의 배열 만들어서 넣어준다칸다