解题思路是先创建一条复制链表,复制链表的val
和原始链表的val
相对应,创建过程中,使用哈希表建立原始结点和复制结点的映射。原始结点为key
,复制结点为value
。那么,在复制链表中查询当前结点的随机指针时,当前对应原始结点的随机指针所映射的值value
就是这个复制结点的随机指针。这个解题思路关键在于利用哈希表的键值对的映射关系。
代码如下:
/*
// 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) {
Node copyhead = new Node(-1);
Node cur1 = copyhead, cur2 = head;
Map<Node, Node> maplist = new HashMap<>();
while(cur2 != null){
cur1.next = new Node(cur2.val);
cur1 = cur1.next;
maplist.put(cur2, cur1);
cur2 = cur2.next;
}
cur2 = head;
while(cur2 != null){
maplist.get(cur2).random = maplist.get(cur2.random);
cur2 = cur2.next;
}
return copyhead.next;
}
}