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
🧭 풀이 시간
20분
👀 체감 난이도
✏️ 문제 설명
여행경로를 짜려고 할 때, a공항에서 b 공항으로 가는 항공권들이 주어짐
방문하는 공항 순서대로 경로 구하기
🔍 풀이 방법
dfs이용
가능한 경로가 2개 이상이면 알파벳 순서가 앞서는 경로를 return 해야했는데, 그래서 경로를 String으로 저장해두고, 나중에 ,로 split해서 정답 return 했음
⏳ 회고
dfs는 헷갈린다