-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCopy_List_With_Random_Pointer_138.py
More file actions
48 lines (40 loc) · 1.52 KB
/
Copy_List_With_Random_Pointer_138.py
File metadata and controls
48 lines (40 loc) · 1.52 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
from typing import Optional
# Definition for a Node.
class Node:
def __init__(self, x: int, next: 'Node' = None, random: 'Node' = None):
self.val = int(x)
self.next = next
self.random = random
class Solution:
def copyRandomList(self, head: 'Optional[Node]') -> 'Optional[Node]':
if head is None:
return None
# Create a new node for each node in the original list
# and insert it in between the original nodes
# e.g. next list: 1 -> 2 -> 3 -> 4
# becomes: 1 -> 1' -> 2 -> 2' -> 3 -> 3' -> 4 -> 4'
curr = head
while curr:
l2 = Node(curr.val)
l2.next = curr.next
curr.next = l2
curr = l2.next
newHead = head.next # head of the new list
# Set the random pointers of the new nodes
# e.g. if 1.random -> 3, then 1'.random -> 3'
curr = head
while curr:
if curr.random:
curr.next.random = curr.random.next # curr.random.next is the new random node
curr = curr.next.next # move to the next original node (skip the new node)
# Separate the new list from the original list
# e.g. 1 -> 1' -> 2 -> 2' -> 3 -> 3' -> 4 -> 4'
# becomes: 1 -> 2 -> 3 -> 4 and 1' -> 2' -> 3' -> 4'
curr = head
while curr:
l2 = curr.next
curr.next = l2.next
if l2.next:
l2.next = l2.next.next
curr = curr.next
return newHead