138. Copy List with Random Pointer

最新推荐文章于 2024-08-13 15:34:52 发布

原创最新推荐文章于 2024-08-13 15:34:52 发布 · 379 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#List

C/C++ 同时被 2 个专栏收录

27 篇文章

订阅专栏

数据结构

5 篇文章

订阅专栏

本文介绍了一种解决复杂链表深拷贝问题的方法。这种链表的节点包含一个额外的随机指针，该指针可以指向链表中的任意节点或null。文章详细阐述了如何创建链表的深拷贝，包括初始化新节点、处理随机指针链接及分离原始链表和拷贝链表的具体步骤。

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of the list.

Subscribe to see which companies asked this question

struct RandomListNode {
    int label;
    RandomListNode *next, *random;
    RandomListNode(int x) : label(x), next(NULL), random(NULL) {}
};
class Solution {
public:
    RandomListNode *copyRandomList(RandomListNode *head) {
        if(head == NULL) return head;

        RandomListNode *p = head;
        while(p != NULL)
        {
            RandomListNode *q = new RandomListNode(p->label);
            q->random = p->random;
            q->next = p->next;
            p->next = q;
            p = p->next->next;
        }

        p = head;
        while(p != NULL)
        {
            if(p->random != NULL)
            {
                p->next->random = p->random->next;
            }
            p = p->next->next;
        }

        RandomListNode *ret = new RandomListNode(0);
        ret->next = head;
        RandomListNode *q = ret;
        p = head;
        while(p != NULL)
        {
            q->next = p->next;
            p->next = q->next->next;
            q = q->next;
            p = p->next;
        }
        return ret->next;
    }
};