剑指offer——复杂链表的复制

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* front = pHead;
            RandomListNode* Head = new RandomListNode(-1);
            RandomListNode* tmp = Head; 
            while(front){
                RandomListNode* node = new RandomListNode(front->label);
                tmp->next = node;
                front = front->next;
                tmp = tmp->next; 
            }
            front = pHead;
            tmp = Head->next;
            while(front){
                if(front->random){
                    tmp->random = this->Find(Head,front->random->label);
                }
                tmp = tmp->next;
                front = front->next; 
            }
            return Head->next;
        }

        RandomListNode* Find(RandomListNode* pHead, int k){
            RandomListNode* front = pHead;
            while(front){
                if(front->label == k){
                    break;
                }
                front = front->next; 
            }
            return front;
        }
};