输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
public class T_25_RandomListNode {
public RandomListNode Clone(RandomListNode pHead) {
if (pHead == null) {
return null;
}
RandomListNode cur = pHead;
RandomListNode temp = null;
while (cur != null) {
temp = cur.next;
cur.next = new RandomListNode(cur.label);
cur.next.next = temp;
cur = temp;
}
cur = pHead;
while (cur != null) {
temp = cur.next.next;
cur.next.random = cur.random != null ? cur.random.next : null;
cur = temp;
}
cur = pHead;
RandomListNode curCopy;
RandomListNode res = pHead.next;
while (cur != null) {
temp = cur.next.next;
curCopy = cur.next;
curCopy.next = temp != null ? temp.next : null;
cur.next = temp;
cur = temp;
}
return res;
}
}
class RandomListNode {
int label;
RandomListNode next;
RandomListNode random;
public RandomListNode(int label) {
this.label = label;
}
}