题目描述
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
运行时间:24ms
占用内存:9400k
/*
public class RandomListNode {
int label;
RandomListNode next = null;
RandomListNode random = null;
RandomListNode(int label) {
this.label = label;
}
}
*/
public class Solution {
public RandomListNode Clone(RandomListNode pHead)
{
if(pHead == null)
return null;
RandomListNode p = pHead;
//将链表复制形如为A->A'->B->B'
while(p != null){
RandomListNode pCloned = new RandomListNode(p.label);
pCloned.next = p.next;
p.next = pCloned;
p = pCloned.next;
}
//开始复制链表的特殊指针
p = pHead;
while( p != null){
RandomListNode pCloned = p.next;
//如果原节点存在复杂指针,则复制来的节点肯定已经复制好了这一节点
if(p.random != null)
pCloned.random = p.random.next;
p = pCloned.next;
}
//将长链表分为原始链表和复制链表
p = pHead;
RandomListNode pClonedHead = p.next;
RandomListNode pCloned = p.next;
while(pCloned != null){
p.next = pCloned.next;
p = p.next;
if(p == null)
break;
pCloned.next = p.next;
pCloned = pCloned.next;
}
return pClonedHead;
}
}