面试150-61（Leetcode138随机链表的复制）

最新推荐文章于 2024-09-13 08:07:28 发布

从月亮走向月亮7

最新推荐文章于 2024-09-13 08:07:28 发布

阅读量390

点赞数 8

文章标签：链表算法 leetcode

本文链接：https://blog.csdn.net/stacey777/article/details/135567269

版权

代码：

/*
// 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 n1 = new Node(head.val);
        Node n2;
        Node newHead = n1;
        Node cur = head;
        Map<Node,Node> map = new HashMap<>();
        map.put(head,newHead);
        while(cur.next!=null){
            cur = cur.next;
            n2 = new Node(cur.val);
            map.put(cur,n2);
            n1.next = n2;
            n1 = n2;
        }
        n1.next = null;
        cur = head;
        Node newCur = newHead;
        while(cur!=null){
            newCur.random = map.get(cur.random);
            cur = cur.next;
            newCur = newCur.next;
        }
        return newHead;
    }
}