25、输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
解法来自:https://blog.csdn.net/qq_41901915/article/details/90286802
/*
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 cur = pHead;
//每个节点后面克隆一个相同的节点
while(cur!=null){
//注意节点的克隆
RandomListNode clone1 = new RandomListNode(cur.label);
clone1.next = cur.next;
cur.next = clone1;
cur = clone1.next;
}
//将克隆的节点的特殊指针指向特定的节点
//将cur指针指向链表的头节点
cur = pHead;
while(cur!=null){
RandomListNode clone2 = cur.next;
if(cur.random!=null){
clone2.random = cur.random.next;
}
cur = clone2.next;
}
//拆分链表
cur = pHead;
RandomListNode resultList = cur.next;
while(cur.next!=null){
RandomListNode clone3 = cur.next;
cur.next = clone3.next;
cur = clone3;
}
return resultList;
}
}