Link : programmers.co.kr/learn/courses/30/lessons/43164
Python
더보기
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 | def DFS(data, start, result, deapth): status = False for i in data: status = status or (len(data[i]) > 0) if status: if start in data: for idx, target in enumerate(data[start]): data[start].remove(target) result[deapth] = target var = DFS(data, target, result, deapth + 1) if var is not None: return result data[start].insert(idx, target) else: return result def solution(tickets): data = dict() counter = 0 for i in tickets: if i[0] not in data: data[i[0]] = [] data[i[0]].append(i[1]) counter += 1 for i in data: data[i].sort() var = DFS(data, 'ICN', [0 for _ in range(counter)], 0) var.insert(0, 'ICN') return var | cs |
FeedBack
cjw.git@gmail.com
'알고리즘 > 소스코드' 카테고리의 다른 글
KOREATECH 1046: 빠른 길 찾기 (0) | 2021.01.22 |
---|---|
KOREATECH 1043: 위성 사진 (0) | 2021.01.21 |
PROGRAMMERS 17687: [3차] n진수 게임 (0) | 2021.01.14 |
PROGRAMMERS 42888: 오픈채팅방 (0) | 2021.01.13 |
PROGRAMMERS 17679: [1차] 프렌즈4블록 (0) | 2021.01.13 |
댓글