程序员成长之旅——复制带随机指针的链表

题目简介

给定一个链表，每个节点包含一个额外增加的随机指针，该指针可以指向链表中的任何节点或空节点。

要求返回这个链表的深拷贝。

LeetCode

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* next;
    Node* random;

    Node() {}

    Node(int _val, Node* _next, Node* _random) {
        val = _val;
        next = _next;
        random = _random;
    }
};
*/
Node* BuyNode(int val)
{
    Node* newnode = (Node*)malloc(sizeof(Node));
    if(newnode == NULL)
    {
        return NULL;
    }
    newnode->val = val;
    newnode->next =NULL;
    newnode->random = NULL;
    return newnode;
}
class Solution {
public:
    Node* copyRandomList(Node* head) {
        //拷贝插入
        Node* cur = head;
        while(cur)
        {
            //记录cur的下一个结点
            Node* next = cur->next;
            //拷贝相同结点
            Node* cpnode = BuyNode(cur->val);
            //插入新结点
            cur->next = cpnode;
            cpnode->next = next;
            //迭代走起来
            cur = next;
        }
        
        //置random
        cur = head;
        while(cur)
        {
            Node* next = cur->next->next;
            Node* cpnode = cur->next;
            
            if(cur->random != NULL)
            cpnode->random = cur->random->next;
            
            if(cur->random == NULL)
            cpnode->random = NULL;
                
            cur = next;
        }
        
        //拆解-链接
        Node* pHead = BuyNode(0);
        Node* tail = pHead;
        cur = head;
        while(cur)
        {
            Node* cpnode = cur->next;
            cur->next = cpnode->next;
            cur = cpnode->next;
            cpnode->next = NULL;
            
            tail->next = cpnode;
            tail = cpnode;
            
        }
        Node* phead = pHead->next;
        free(pHead);
        return phead;
    }
};