Copy List with Random Pointer
Description
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.
Code
/*
// Definition for a Node.
class Node {
int val;
Node next;
Node random;
public Node(int val) {
this.val = val;
this.next = null;
this.random = null;
}
}
*/
class Solution {
public Node copyRandomList(Node head) {
if (head == null) return null;
Node iter = head;
Node next = null;
while (iter != null) {
Node node = new Node(iter.val);
next = iter.next;
iter.next = node;
node.next = next;
iter = next;
}
iter = head;
Node randomNext = null;
while (iter != null) {
if (iter.random != null) {
next = iter.next;
randomNext = iter.random.next;
next.random = randomNext;
}
iter = iter.next.next;
}
Node result = head.next;
iter = head.next;
while (iter != null && iter.next != null) {
head.next = iter.next;
iter.next = iter.next.next;
iter = iter.next;
head = head.next;
}
head.next = null;
return result;
}
}
Last updated
Was this helpful?