输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
思路:
1、复制每个节点,如:复制节点A得到A1,将A1插入节点A后面
2、遍历链表,A1->random = A->random->next;
思路:
1、复制每个节点,如:复制节点A得到A1,将A1插入节点A后面
2、遍历链表,A1->random = A->random->next;
3、将链表拆分成原链表和复制后的链表
package jianzhioffer;
public class Solution26 {
public class RandomListNode {
int label;
RandomListNode next = null;
RandomListNode random = null;
RandomListNode(int label) {
this.label = label;
}
}
public RandomListNode Clone(RandomListNode pHead) {
colneNodes(pHead);
connectRandomNodes(pHead);
return reConnnectNodes(pHead);
}
private void colneNodes(RandomListNode pHead) {
RandomListNode pNode = pHead;
while(pNode!=null){
RandomListNode pCloneNode = new RandomListNode(pNode.label);
pCloneNode.next = pNode.next;
pCloneNode.random = null;
pNode.next = pCloneNode;
pNode = pCloneNode.next;
}
}
private void connectRandomNodes(RandomListNode pHead) {
RandomListNode pNode = pHead;
while(pNode!=null){
RandomListNode pCloned = pNode.next;
if(pNode.random!=null){
pCloned.random = pNode.random;
}
pNode = pCloned.next;
}
}
private RandomListNode reConnnectNodes(RandomListNode pHead) {
RandomListNode pNode = pHead;
RandomListNode pClonedHead = null;
RandomListNode pClonedNode = null;
if(pNode!=null){
pClonedHead = pClonedNode = pNode.next;
pNode.next = pClonedNode.next;
pNode = pNode.next;
}
while(pNode!=null){
pClonedNode.next = pNode.next;
pClonedNode = pClonedNode.next;
pNode.next = pClonedNode.next;
pNode = pNode.next;
}
return pClonedHead;
}
}