LeetCode 138. Copy List with Random Pointer（哈希）

题目来源：https://leetcode.com/problems/copy-list-with-random-pointer/

问题描述

138. Copy List with Random Pointer

Medium

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.

 

Example 1:

Input:

{"$id":"1","next":{"$id":"2","next":null,"random":{"$ref":"2"},"val":2},"random":{"$ref":"2"},"val":1}

 

Explanation:

Node 1's value is 1, both of its next and random pointer points to Node 2.

Node 2's value is 2, its next pointer points to null and its random pointer points to itself.

 

Note:

1. You must return the copy of the given head as a reference to the cloned list.

------------------------------------------------------------

题意

给定一个单链表，每个节点另有一个random指针指向链表中随机下标的节点。求该链表的深拷贝

------------------------------------------------------------

思路

时间复杂度为O(n)的算法的关键是解决random指针随机访问链表元素的问题。解决方案是用一个键为原链表的节点、值为新链表的节点的HashMap，实现random指针指向节点的O(1)的访问。

另外由于题目里Node类的代码没有实现hashCode和equals方法，因此HashMap中的key是对象的引用。

------------------------------------------------------------

代码

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

    public Node() {}

    public Node(int _val,Node _next,Node _random) {
        val = _val;
        next = _next;
        random = _random;
    }
};
*/
class Solution {
    public Node copyRandomList(Node head) {
        if (head == null) {
            return null;
        }
        HashMap<Node, Node> map = new HashMap<Node, Node>();
        Node newHead = new Node(), p = head, np = newHead;
        newHead.val = head.val;
        map.put(head, newHead);
        while (p != null) {
            if (p.next != null && !map.containsKey(p.next)) {
                Node q = new Node();
                q.val = p.next.val;
                map.put(p.next, q);
            }
            np.next = map.get(p.next);
            if (p.random != null && !map.containsKey(p.random)) {
                Node q = new Node();
                q.val = p.random.val;
                map.put(p.random, q);
            }
            np.random = map.get(p.random);
            p = p.next;
            np = np.next;
        }
        return newHead;
    }
}