목록1466. Reorder Routes to Make All Paths Lead to the City Zero (1)

Scribbling

LeetCode: 1466. Reorder Routes to Make All Paths Lead to the City Zero

DFS로 쉽게 풀 수 있다. class Solution: def minReorder(self, n: int, connections: List[List[int]]) -> int: self.graph = [[] for _ in range(n)] self.connections_set = set() for u, v in connections: self.graph[u].append(v) self.graph[v].append(u) self.connections_set.add((u, v)) visited = [False] * n self.ret = 0 self.dfs(0, visited) return self.ret def dfs(self, node, visited): visited[node] = True for v..
Computer Science/Coding Test 2021. 11. 23. 17:52
이전 Prev 1 Next 다음