We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent bfe7d2e commit 791cfb8Copy full SHA for 791cfb8
solution/2000-2099/2097.Valid Arrangement of Pairs/Solution.py
@@ -0,0 +1,26 @@
1
+class Solution:
2
+ def validArrangement(self, pairs):
3
+ graph = defaultdict(deque)
4
+ degree = defaultdict(int)
5
+
6
+ for u, v in pairs:
7
+ graph[u].append(v)
8
+ degree[u] += 1
9
+ degree[v] -= 1
10
11
+ start = pairs[0][0]
12
+ for node in graph:
13
+ if degree[node] > 0:
14
+ start = node
15
+ break
16
17
+ path = []
18
19
+ def traverse(node):
20
+ while graph[node]:
21
+ traverse(graph[node].popleft())
22
+ path.append(node)
23
24
+ traverse(start)
25
+ path.reverse()
26
+ return [[path[i], path[i + 1]] for i in range(len(path) - 1)]
0 commit comments