25 复杂链表的复制

输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点），返回结果为复制后复杂链表的head。（注意，输出结果中请不要返回参数中的节点引用，否则判题程序会直接返回空）

public class Solution {
    public RandomListNode Clone(RandomListNode pHead) {
        copyList(pHead);
        copyRandom(pHead);
        return splitList(pHead);
    }

    //复制一份链表
    public void copyList(RandomListNode pHead){
        RandomListNode cur = pHead;
        while(cur != null){
            RandomListNode temp = new RandomListNode(cur.label);
            temp.next = cur.next;
            temp.random = null;
            cur.next = temp;
            cur = temp.next;
        }
    }

    //复制特殊指针
    public void copyRandom(RandomListNode pHead){
        RandomListNode cur = pHead;
        RandomListNode clone = null;
        while(cur != null){
            clone = cur.next;
            if(cur.random != null){
                clone.random = cur.random.next;
            }
            cur = clone.next;
        }
    }

    //拆分链表
    public RandomListNode splitList(RandomListNode pHead){

        RandomListNode orign, cloneHead = null, clone = null;
        orign = pHead;
        if (orign != null) {
            cloneHead = orign.next;
            orign.next = cloneHead.next;
            orign = cloneHead.next;
            clone = cloneHead;
        }

        while (orign != null) {
            RandomListNode temp = orign.next;
            orign.next = temp.next;
            orign = orign.next;
            clone.next = temp;
            clone = temp;
        }

        return cloneHead;
    }
}