题目描述:输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点。
/**
* 复杂链表的复制
* @author 过路的守望
*
*/
public class CoomplexListNode {
public RandomListNode copyRandomListNode(RandomListNode Head){
if(Head == null){
return null;
}
RandomListNode head = Head;
/*
* 复制每个节点。
* 如:复制节点A得到A*,将A*插入节点A后面
*/
while(head != null){
RandomListNode next = new RandomListNode(head.label);
next.next = head.next;
head.next =next.next;
head = head.next;
}
/*
* 遍历链表,A*->random = A->random->next;
*/
head = Head;
while(head != null){
RandomListNode next = head.next;
if(head.random != null){
next.random = head.random.next;
}
head = next.next;
}
/*
* 将链表拆分为原链表和复制后的链表
*/
head = Head;
RandomListNode copy= Head.next;
while(head != null){
RandomListNode next = head.next;
head.next = next.next;
head = next.next;
if(head != null){
next.next = head.next;
}
}
return copy;
}
}
/**
* 链表类
* @author 过路的守望
*
*/
class RandomListNode {
int label;
RandomListNode next = null;
RandomListNode random = null;
RandomListNode(int label) {
this.label = label;
}
}