面试经典 150 题 4 —（链表）— 138. 随机链表的复制

138.随机链表的复制

方法一：

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* next;
    Node* random;
    
    Node(int _val) {
        val = _val;
        next = NULL;
        random = NULL;
    }
};
*/
// head就指向第一个有数据的节点
class Solution {
public:
    Node* copyRandomList(Node* head) {
        if(!head){
            return nullptr;
        }
        // 创建一个哈希表，key是原节点，value是新节点
        unordered_map<Node*, Node*> map_Old_New;
        Node *curOld = head;
        // 将原节点和新节点放入哈希表中，用到->next，while中条件就是curold不为空
        while(curOld){
        	// 注意创建一个新的节点得用new Node(curOld->val)
            Node *newNode = new Node(curOld->val);
            map_Old_New.insert({curOld, newNode});
            curOld = curOld->next;
        }
        curOld = head;
        // 遍历原链表，设置新节点的next和random
        while(curOld){
            // curOld是原节点，map_Old_New[curOld]是对应的新节点，
            // curOld->next是原节点的下一个，map_Old_New[curOld->next]是原节点的下一个节点对应的新节点
            if(curOld->next){
                map_Old_New[curOld]->next = map_Old_New[curOld->next];
            }
            // curOld->random是原节点随即指向，map_Old_New[curOld->random]是原节点随机指向的节点对应的新节点
            if(curOld->random){
                map_Old_New[curOld]->random = map_Old_New[curOld->random];
            }

            curOld = curOld->next;
        }
        return map_Old_New[head];
    }
};

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* next;
    Node* random;
    
    Node(int _val) {
        val = _val;
        next = NULL;
        random = NULL;
    }
};
*/
// head就指向第一个有数据的节点
class Solution {
public:
    Node* copyRandomList(Node* head) {
        if(!head){
            return nullptr;
        }
        Node *cur = head;
        // 1.在原节点的每个节点后创建一个节点
        while(cur){
            Node *newNode = new Node(cur->val);
            newNode->next = cur->next;
            cur->next = newNode;
            cur = cur->next->next;
        }
        // 2.更新新节点的random指针
        cur = head;
        while(cur){
            if(cur->random == nullptr){
                cur->next->random = nullptr;
            }
            else{
                cur->next->random = cur->random->next;
            }
            cur = cur->next->next;
        }
        // 3.将两个链表拆开
        Node *dummy = new Node(-1);
        Node *curnew = dummy, *curold = head;
        while(curold){
            Node *oldNext = curold->next->next;
            curnew->next = curold->next;
            curold->next = oldNext;
            curnew = curnew->next;
            curold = curold->next;
        }
        return dummy->next;
    }
};