剑指 Offer 35. 复杂链表的复制

最新推荐文章于 2024-10-16 19:08:56 发布

Z，FJ

最新推荐文章于 2024-10-16 19:08:56 发布

阅读量121

点赞数

分类专栏：算法文章标签：算法链表 leetcode 剑指Offer

本文链接：https://blog.csdn.net/weixin_43659449/article/details/107318489

版权

算法专栏收录该内容

28 篇文章 0 订阅

订阅专栏

题目链接

方法一：拷贝
在这里插入图片描述

/*
// 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;
        //链表复制
        while (cur != null) {
            Node tmp = cur.next;
            cur.next = new Node(cur.val, null, null);
            cur.next.next = tmp;
            cur = tmp;
        }
        cur = head;
        while (cur != null) {
            if (cur.random != null) {
                cur.next.random = cur.random.next;
            }
            cur = cur.next.next;
        }
        cur = head;
        Node copy_head = cur.next;
        Node copy_cur = copy_head;
        while (copy_cur.next != null) {
            cur.next = cur.next.next;
            cur = cur.next;

            copy_cur.next = copy_cur.next.next;
            copy_cur = copy_cur.next;
        }
        cur.next = null; 
        return copy_head;
    }
}

时间复杂度：O(N)
空间复杂度：O(1)

方法二：用hash表

/*
// 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;
        }

        Map<Node, Node> map = new HashMap<>();
        Node node = head;
        while (node != null) {
            map.put(node, new Node(node.val, null, null));
            node = node.next;
        }
        node = head;
        while (node != null) {
            map.get(node).next = map.get(node.next);
            map.get(node).random = map.get(node.random);
            node = node.next;
        }

        return map.get(head);
    }
}