Skip to content

Commit 791cfb8

Browse files
authored
Create Solution.py
1 parent bfe7d2e commit 791cfb8

File tree

1 file changed

+26
-0
lines changed
  • solution/2000-2099/2097.Valid Arrangement of Pairs

1 file changed

+26
-0
lines changed
Lines changed: 26 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -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

Comments
 (0)