JianZhi Offer JZ35

JZ35 复杂链表的复制
https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba
First time using C++ solving algorithm problem, fxxk, the bug is much much more hard to be found.
After 1 year, I should start coding for algorithm again.
However, this time would be different.
Time for preparation is short & I also need to learn OS in parallel. It would be more challenge, but I enjoy it.

/*
struct RandomListNode {
    int label;
    struct RandomListNode *next, *random;
    RandomListNode(int x) :
            label(x), next(NULL), random(NULL) {
    }
};
*/
#include <cstddef>

class Solution {
public:
    RandomListNode* Clone(RandomListNode* pHead) {
        if(pHead == NULL) return pHead;
        RandomListNode *p, *newHead;
        RandomListNode *dummy, *pHeadDummy;
        pHeadDummy = pHead;
        int i = 0;
        p = new RandomListNode(-1); //prev
        dummy = p;
        while(pHead){
            p->next = new RandomListNode(pHead->label); // use new address for copy
            //p->label = pHead->label;
            cout << pHead->label << endl;
            p = p -> next;
            pHead = pHead->next;   
        }
        p = dummy->next;
        pHead = pHeadDummy;
        while(pHead != NULL){
            
            //p->random = move(newHead, pHead->random->label);
            if(pHead->random != NULL){
                newHead = dummy->next;
                p->random = move(newHead,pHead->random->label);
                int count = pHead->random->label;
                cout << count << endl;
            }
            pHead = pHead->next;
            p = p->next;
        }
        return dummy->next;
    }


    RandomListNode* move(RandomListNode* node, int val){
        if(val == NULL) return NULL;
        while(--val){
            node = node -> next;
        }
        return node;
    }
};