复制带随机指针的链表( LeetCode 138 )

题目链接

https://leetcode.cn/problems/copy-list-with-random-pointer/

问题分析

https://www.algomooc.com/708.html

代码实现

java

/*
// Definition for a Node.
class Node {
    int val;
    Node next;
    Node random;

    public Node(int val) {
        this.val = val;
        this.next = null;
        this.random = null;
    }
}
*/

class Solution {
    public Node copyRandomList(Node head) {
        if(head==null)return null;
        Node cur=head;
        Map<Node,Node> map=new HashMap<>();//哈希map用来存储已经创建的节点
        //第一次遍历
        while(cur!=null)
        {
            map.put(cur,new Node(cur.val));
            cur=cur.next;
        }
        //第二次遍历
        cur=head;
        while(cur!=null)
        {
            Node valcur=map.get(cur);
            Node valNextNode=map.get(cur.next);
            valcur.next=valNextNode;
            Node valRandomNode=map.get(cur.random);
            valcur.random=valRandomNode;
            cur=cur.next;
        }
        return map.get(head);
    }
}

c++

/*
// Definition for a Node.
class Node {
public:
    int val;
    Node* next;
    Node* random;
    
    Node(int _val) {
        val = _val;
        next = NULL;
        random = NULL;
    }
};
*/

class Solution {
public:
    Node* copyRandomList(Node* head) {
        if(head==NULL)return NULL;
        Node* cur=head;
        unordered_map<Node*,Node*> map;

        while(cur!=NULL)
        {
            Node *valNode=new Node(cur->val);
            map[cur]=valNode;
            cur=cur->next;
        }

        cur=head;

        while(cur!=NULL)
        {
            Node* valcur=map[cur];
            Node* valNextNode=map[cur->next];
            valcur->next=valNextNode;
            Node* valRandomNode=map[cur->random];
            valcur->random=valRandomNode;
            cur=cur->next;
        }
        return map[head];
    }
};

python

"""
# Definition for a Node.
class Node:
    def __init__(self, x, next=None, random=None):
        self.val = int(x)
        self.next = next
        self.random = random
"""

class Solution(object):
    def copyRandomList(self, head):
        """
        :type head: Node
        :rtype: Node
        """
        if head == None :
           return None
        cur=head

        map=dict()
        while cur!=None:
            new_node=Node(cur.val,None,None)
            map[cur]=new_node
            cur=cur.next

        cur=head
        while cur!=None:
            valcur=map.get(cur)
            valNextNode=map.get(cur.next)
            valcur.next=valNextNode
            valRandomNode=map.get(cur.random)
            valcur.random=valRandomNode
            cur=cur.next
        return map.get(head)


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值