LeetCode官方教程参考答案,穷学生只充了一个月的会员,记录下来备忘
A linked list of length n
is given such that each node contains an additional random pointer, which could point to any node in the list, or null
.
Construct a deep copy of the list. The deep copy should consist of exactly n
brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the next
and random
pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.
For example, if there are two nodes X
and Y
in the original list, where X.random --> Y
, then for the corresponding two nodes x
and y
in the copied list, x.random --> y
.
Return the head of the copied linked list.
The linked list is represented in the input/output as a list of n
nodes. Each node is represented as a pair of [val, random_index]
where:
val
: an integer representingNode.val
random_index
: the index of the node (range from0
ton-1
) that therandom
pointer points to, ornull
if it does not point to any node.
Your code will only be given the head
of the original linked list.
Example 1:
Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]] Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]
Example 2:
Input: head = [[1,1],[2,1]] Output: [[1,1],[2,1]]
Example 3:
Input: head = [[3,null],[3,0],[3,null]] Output: [[3,null],[3,0],[3,null]]
Constraints:
0 <= n <= 1000
-104 <= Node.val <= 104
Node.random
isnull
or is pointing to some node in the linked list.class Solution(object): def copyRandomList(self, head): """ :type head: Node :rtype: Node """ if not head: return head # Creating a new weaved list of original and copied nodes. ptr = head while ptr: # Cloned node new_node = Node(ptr.val, None, None) # Inserting the cloned node just next to the original node. # If A->B->C is the original linked list, # Linked list after weaving cloned nodes would be A->A'->B->B'->C->C' new_node.next = ptr.next ptr.next = new_node ptr = new_node.next ptr = head # Now link the random pointers of the new nodes created. # Iterate the newly created list and use the original nodes random pointers, # to assign references to random pointers for cloned nodes. while ptr: ptr.next.random = ptr.random.next if ptr.random else None ptr = ptr.next.next # Unweave the linked list to get back the original linked list and the cloned list. # i.e. A->A'->B->B'->C->C' would be broken to A->B->C and A'->B'->C' ptr_old_list = head # A->B->C ptr_new_list = head.next # A'->B'->C' head_new = head.next while ptr_old_list: ptr_old_list.next = ptr_old_list.next.next ptr_new_list.next = ptr_new_list.next.next if ptr_new_list.next else None ptr_old_list = ptr_old_list.next ptr_new_list = ptr_new_list.next return head_new