LeetCode-M-Copy List with Random Pointe

最新推荐文章于 2024-08-30 22:58:17 发布

原创最新推荐文章于 2024-08-30 22:58:17 发布 · 249 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #list

数据结构与算法专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种含有随机指针的单链表的深拷贝方法。通过在原链表中插入新节点并调整随机指针，最后分离出完整的拷贝链表。此方法适用于面试和技术分享。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题意

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.

解法

回头补上

实现

/**
 * Definition for singly-linked list with a random pointer.
 * struct RandomListNode {
 *     int label;
 *     RandomListNode *next, *random;
 *     RandomListNode(int x) : label(x), next(NULL), random(NULL) {}
 * };
 */
class Solution {
public:
    RandomListNode *splitCopyList(RandomListNode* head){
        RandomListNode* copyhead = head->next;
        RandomListNode* cur = head;
        while(cur != NULL){
            RandomListNode* ccur = cur->next;
            cur->next = ccur->next;
            if(cur->next != NULL) ccur->next = cur->next->next;
            else ccur->next = NULL;
            cur = cur->next;
        }
        return copyhead;
    }

    RandomListNode *copyRandomRela(RandomListNode* head){
        RandomListNode* cur = head;
        while(cur != NULL){
            RandomListNode* random = cur->random;
            RandomListNode* ccur = cur->next;
            if(random != NULL){
                ccur->random = random->next;
            }
            cur = ccur->next;
        }
        return head;
    }
    RandomListNode *copyNextRela(RandomListNode* head){
        RandomListNode* cur = head;
        while(cur != NULL){
            RandomListNode* ccur = new RandomListNode(cur->label);
            ccur->next = cur->next;
            cur->next = ccur;
            cur = ccur->next;
        }
        return head;
    }
    RandomListNode *copyRandomList(RandomListNode *head) {
        if(head == NULL) return head;
        RandomListNode* nextHead = copyNextRela(head);
        RandomListNode* randomHead = copyRandomRela(head);
        RandomListNode* copyHead = splitCopyList(randomHead);
        return copyHead;
    }
};