问题描述:
/**
* 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.
*/
给你一个链表,这个链表不仅有next指针还有random指针,random指针可以随机指向一个节点,也可以指向为空也就是没有random指针。现在要让你把这个链表复制下来。
下面图片均来自网络:
比如这样的链表:
浅色线是next指针,深色的粗线是random指针。
解题思路就是构造一个链表,镶嵌到原链表中,然后复制原链表的关系,最把新链表提取出来,如图所示:
具体代码如下:
/**
*public class RandomListNode {
* int label;
* RandomListNode next;
* RandomListNode random;
* public RandomListNode(int label)
* {
* this.label=label;
* next=null;
* random=null;
* }
*
*}
*/
public RandomListNode copyRandomList(RandomListNode head) {
if (head == null)
return head;
RandomListNode cur = head;
//第一遍扫描:对每个结点进行复制,把复制出来的新结点插在原结点之后
while (cur != null) {
RandomListNode newNode = new RandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
}
cur = head;
//第二遍扫描:根据原结点的random,给新结点的random赋值
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
}
cur = cur.next.next;
}
cur = head.next;
RandomListNode newHead = cur;
RandomListNode old = head;
//第三遍扫描:把新结点从原链表中拆分出来
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
}
cur = cur.next;
old = old.next;
}
return newHead;
}