LeetCode-Copy List with Random Pointer

18 篇文章 0 订阅
18 篇文章 0 订阅

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.

Solution:

Code:

<span style="font-size:14px;">/**
 * 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 == NULL) return head;
        RandomListNode *copyHead = head, *copy;
        while (copyHead != NULL) {
            copy = new RandomListNode(copyHead->label);
            copy->next = copyHead->next;
            copyHead->next = copy;
            copyHead = copy->next;
        }
        copyHead = head;
        while (copyHead != NULL) {
            if (copyHead->random)
                copyHead->next->random = copyHead->random->next;
            copyHead = copyHead->next->next;
        }
        copyHead = head->next;
        copy = copyHead;
        while (head != NULL) {
            head->next = copy->next;
            head = head->next;
            if (head == NULL) break;
            copy->next = head->next;
            copy = copy->next;
        }
        return copyHead;
    }
};</span>



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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值