【LeetCode】Copy List with Random Pointer

Copy List with Random Pointer

  Total Accepted: 16149  Total Submissions: 70123 My Submissions

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.



三步走

1-复制结点

2-复制随机结点

3-拆解

这里有三个地方要注意判断是否是空

/**
 * 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;
        //copy
        RandomListNode *p = head;
        while (p) {
            RandomListNode *q = new RandomListNode(p->label);
            q->next = p->next;
            p->next = q;
            p = q->next;
        }
        RandomListNode *q = NULL;
        //copy randomNode
        p = head, q = p->next;
        while (p) {
            if(p->random)/
                q->random = p->random->next;
            p = q->next;
            if(p)//
                q = p->next;
        }
        //broken
        RandomListNode *tmp_head = head->next;
        p = head, q = p->next;
        while (p) {
            p->next = q->next;
            p = q->next;
            if (p) {///
                q->next = p->next;
                q = p->next;
            }
        }
        return tmp_head;
    }
};






评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值