-
Notifications
You must be signed in to change notification settings - Fork 141
/
Copy pathcopy_random_pointer.py
35 lines (33 loc) · 972 Bytes
/
copy_random_pointer.py
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
"""
A linked list is given such that each node contains an additional random
pointer which could point to any node in the list or null.
Return a deep copy of the list.
"""
# class Solution:
# @param head, a RandomListNode
# @return a RandomListNode
# def copyRandomList(self, head):
# dic = dict()
# m = n = head
# while m:
# dic[m] = RandomListNode(m.label)
# m = m.next
# while n:
# dic[n].next = dic.get(n.next)
# dic[n].random = dic.get(n.random)
# n = n.next
# return dic.get(head)
#O(n)
# class Solution:
# @param head, a RandomListNode
# @return a RandomListNode
# def copyRandomList(self, head):
# copy = collections.defaultdict(lambda: RandomListNode(0))
# copy[None] = None
# node = head
# while node:
# copy[node].label = node.label
# copy[node].next = copy[node.next]
# copy[node].random = copy[node.random]
# node = node.next
# return copy[head]