Copy List with Random Pointer

最新推荐文章于 2024-01-12 14:44:53 发布

num24

最新推荐文章于 2024-01-12 14:44:53 发布

阅读量351

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/num24/article/details/40274341

版权

LeetCode 专栏收录该内容

10 篇文章

订阅专栏

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.

<span style="font-size:18px;">/**
 * 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 *copyRandomList(RandomListNode *head) {
        RandomListNode *copyhead,*copy_ptr,*tmp,*p=head;
        if(!head)
            return NULL;
        while(p)//第一步往列表每一个元素后面插入一个元素，该元素的值与前一个相同
        {
            copy_ptr=new RandomListNode(p->label);
            copy_ptr->next=p->next;
            p->next=copy_ptr;
            if(copy_ptr->next)
                p=copy_ptr->next;
            else
                break;
        }
        p=head;
        copy_ptr=head->next;
        while(p)//第二步把random指针正确置位
        {
            if(p->random==NULL)
                copy_ptr->random=NULL;
            else
                copy_ptr->random=p->random->next;
            if(p->next)
                p=p->next->next;
            if(copy_ptr->next)
                copy_ptr=copy_ptr->next->next;
        }
        copyhead=head->next;
        copy_ptr=head->next;
        p=head;
	    while(copy_ptr->next)//拆分两个链表
	    {
	        
	        p->next=copy_ptr->next;
	        p=copy_ptr;
	        if(copy_ptr->next!=NULL)
	             copy_ptr=copy_ptr->next;
		  
	    }
	    p->next=NULL;
    return copyhead;
    }
};</span>