Description:输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
/*
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 pHead;
RandomListNode head = new RandomListNode(pHead.label);
head.next = pHead.next;
head.random = pHead.random;
RandomListNode par = head;
pHead = pHead.next;
while (pHead != null) {
RandomListNode cur = new RandomListNode(pHead.label);
cur.next = pHead.next;
cur.random = pHead.random;
par.next = cur;
par = cur;
pHead = pHead.next;
}
return head;
}
}