1. ๊ทธ๋ํ๋ฅผ ์ ์ํ๊ณ ๋ฐ์ดํฐ ๋ฃ๊ธฐ
from collections import default
def solution(tickets):
graph = defaultdict(list)
for a, b in tickets: graph[a].append(b)
for key in graph.keys(): graph[key].sort()
2. ํ์ ํจ์ ๋ง๋ค๊ธฐ
def dfs(graph, path, visit):
if path:
to = path[-1]
if graph[to]: path.append(graph[to].pop(0))
else: visit.append(path.pop())
dfs(graph, path, visit)
return visit[::-1]
from collections import default
def dfs(graph, path, visit):
if path:
to = path[-1]
if graph[to]: path.append(graph[to].pop(0))
else: visit.append(path.pop())
dfs(graph, path, visit)
return visit[::-1]
def solution(tickets):
graph = defaultdict(list)
for a, b in tickets: graph[a].append(b)
for key in graph.keys(): graph[key].sort()
return dfs(graph, ["ICN"], [])