输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的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 resultNode = new RandomListNode(pHead.label), tempHead = resultNode;
while (pHead != null) {
tempHead.label = pHead.label;
if (pHead.random != null) {
tempHead.random = new RandomListNode(pHead.random.label);
} else {
tempHead.random = null;
}
if (pHead.next != null) {
tempHead.next = new RandomListNode(pHead.next.label);
} else {
tempHead.next = null;
break;
}
pHead = pHead.next;
tempHead = tempHead.next;
}
return resultNode;
}
}