【剑指Offer】35. 复杂链表的复制

public class RandomListNode {
    int label;
    RandomListNode next = null;
    RandomListNode random = null;

    RandomListNode(int label) {
        this.label = label;
    }
}

/*
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 clone = new RandomListNode(cur.label);
            clone.next = cur.next;
            cur.next = clone;
            
            cur = clone.next;
        }
        // 拷贝指针
        cur = pHead;
        while(cur != null) {
            RandomListNode clone = cur.next;
            if(cur.random != null)
                clone.random = cur.random.next;
            
            cur = clone.next;
        }
        // 分离两组
        cur = pHead;
        RandomListNode pCloneHead = pHead.next;
        while(cur.next != null) {
            RandomListNode next = cur.next;
            cur.next = next.next;
            
            cur = next;
        }
        
        return pCloneHead;
    }
}