[LeetCode] Copy List with Random Pointer

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.

/**
 * 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) {
        if(head == nullptr)
            return nullptr;
        RandomListNode *result = nullptr;
        RandomListNode *pOld = head, *pNew = result;
        do
        {
            pNew = new RandomListNode(pOld->label);
            if(result == nullptr)
                result = pNew;
            pNew->next = pOld->next;
            pOld->next = pNew;
            pOld = pNew->next;
        }while(pNew->next);
        
        pOld = head;
        while(pOld)
        {
            if(pOld->random)
                pOld->next->random = pOld->random->next;
            pOld = pOld->next->next;
        }
        
        pOld = head;
        pNew = result;
        while(pNew->next)
        {
            pOld->next = pNew->next;
            pOld = pOld->next;
            pNew->next = pOld->next;
            pNew = pNew->next;
        }
        pOld->next = nullptr;
        pNew->next = nullptr;
        return result;
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值