-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path090-clone-graph.py
More file actions
65 lines (46 loc) · 1.44 KB
/
090-clone-graph.py
File metadata and controls
65 lines (46 loc) · 1.44 KB
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
from collections import deque
class Node:
def __init__(self, val=0, neighbors=None):
self.val = val
self.neighbors = neighbors if neighbors is not None else []
class Solution:
def cloneGraph(self, node: Node) -> Node:
if not node:
return
seen = {node: Node(node.val)}
que = deque()
que.append(node)
while que:
n = que.popleft()
# When dequeuing an element, we're sure we already cloned it
# as it's a BFS and we start by creating the root
for u in n.neighbors:
if u not in seen:
que.append(u)
seen[u] = Node(u.val)
seen[n].neighbors.append(seen[u])
return seen[node]
def cloneGraph_rec(self, node: Node) -> Node:
def recurse(node: Node) -> Node:
if not node:
return None
if node in seen:
return seen[node]
copy = Node(node.val)
seen[node] = copy
for u in node.neighbors:
n = recurse(u)
copy.neighbors.append(n)
return copy
seen = {}
return recurse(node)
# [[2,4],[1,3],[2,4],[1,3]]
one = Node(1)
two = Node(2)
three = Node(3)
four = Node(4)
one.neighbors = [two, four]
two.neighbors = [one, three]
three.neighbors = [two, four]
four.neighbors = [one, three]
Solution().cloneGraph_rec(one)