剑指数据结构-复杂链表的复制

/*
struct RandomListNode {
    int label;
    struct RandomListNode *next, *random;
    RandomListNode(int x) :
            label(x), next(NULL), random(NULL) {
    }
};
*/
class Solution {
public:
    RandomListNode* Clone(RandomListNode* pHead)
    {
        if(pHead == NULL)
            return NULL;
        RandomListNode* currentNode = pHead;
        while(currentNode){ //1、复制每个结点，如复制结点A得到A1，将结点A1插到结点A后面；
            RandomListNode *cloneNode = new RandomListNode(currentNode->label);
            RandomListNode* nextNode = currentNode->next;
            currentNode->next = cloneNode;
            cloneNode->next = nextNode;
            currentNode = nextNode;
        }
        currentNode = pHead;
        while(currentNode && currentNode->next){  //2、重新遍历链表，复制老结点的随机指针给新结点，如A1.random = A.random.next;
            currentNode->next->random = currentNode->random==NULL?NULL:currentNode->random->next;//看看图
            currentNode = currentNode->next->next;
            
        }
         currentNode = pHead;
         RandomListNode *pCloneHead = pHead->next; 
        while(currentNode){ //3、拆分链表，将链表拆分为原链表和复制后的链表
            RandomListNode* cloneNode = currentNode->next;
            currentNode->next = cloneNode->next;
            cloneNode->next = cloneNode->next==NULL?NULL:cloneNode->next->next;
            currentNode = currentNode->next;
        }
        return pCloneHead;
    }
};