138. Copy List with Random Pointer
Medium
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.
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
) where random pointer points to, ornull
if it does not point to any node.
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]]
Example 4:
Input: head = []
Output: []
Explanation: Given linked list is empty (null pointer), so return null.
Constraints:
-10000 <= Node.val <= 10000
Node.random
is null or pointing to a node in the linked list.- Number of Nodes will not exceed 1000.
笔记:
思路就是在原始链表的每个节点后面插入一个新的节点,代表该原始节点的深拷贝节点,然后更新深拷贝链表的next和random,深拷贝链表的头节点就是原始链表head节点的next节点,即head.next
深copy一个链表,这个题的关键点是有一个random。这个题隐含的信息其实就是相对位置,因为random的node位置是随机的,所以需要根据原来的链表去赋值深拷贝链表的random。这个题通过在原始链的基础上,每个点后面再插入一个新的节点,然后根据原来链表的相对位置去确定深拷贝链表的random。参考了https://www.cnblogs.com/zuoyuan/p/3745126.html
需要注意的地方,因为是利用了相对位置去做的,需要考虑next节点和random节点None的情况。
以后做链表题目,当用到某一个节点的value时,想一下这个节点是不是会为空。
在调整新生成的链表的next和random节点时,原来的节点next不能还原到一开始的链表,因为后面要使用这next的相对位置,也就是下面注释掉的部分不能加
class Solution:
def copyRandomList(self, head: 'Node') -> 'Node':
if not head:
return head
node = head
while node:
new_node = Node(node.val)
node_next = node.next
node.next = new_node
new_node.next = node_next
node = node_next
rlt = head.next
node = head
while node:
node.next.random = node.random.next if node.random else None
node_next = node.next.next
node.next.next = node_next.next if node_next else None
# node.next = node_next
node = node_next
return rlt