101차 3번 문제 풀이

Author: hangyeol

live10/test101/문제3/백한결.py

@@ -0,0 +1,24 @@
+from collections import deque
+
+def solution(n, edge):
+    graph = [[] for _ in range(n + 1)]
+
+    for a, b in edge:
+        graph[a].append(b)
+        graph[b].append(a)
+
+    distance = [-1] * (n + 1)
+    distance[1] = 0
+
+    queue = deque([1])
+
+    while queue:
+        now = queue.popleft()
+        for neighbor in graph[now]:
+            if distance[neighbor] == -1:
+                distance[neighbor] = distance[now] + 1
+                queue.append(neighbor)
+
+    max_distance = max(distance)
+
+    return distance.count(max_distance)