leetcode #138. Copy List with Random Pointer

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.

The Linked List is represented in the input/output as a list of n nodes. Each node is represented as a pair of [val, random_index] where:

val: an integer representing Node.val
random_index: the index of the node (range from 0 to n-1) where random pointer points to, or null if it does not point to any node.

Example 1:

Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]
Example 2:

Input: head = [[1,1],[2,1]]
Output: [[1,1],[2,1]]
Example 3:

Input: head = [[3,null],[3,0],[3,null]]
Output: [[3,null],[3,0],[3,null]]
Example 4:

Input: head = []
Output: []
Explanation: Given linked list is empty (null pointer), so return null.

Constraints:

-10000 <= Node.val <= 10000
Node.random is null or pointing to a node in the linked list.
Number of Nodes will not exceed 1000.

本体题目中讲到，有一个list 其中有两个 pointer 一个指向next， 一个指向random， 要求deepcopy

什么叫deepcopy呢？第一次看到这个词比较费解
看了解释后明白了一些
举两个例子

ex1
ListNode a = new ListNode（1）；
ListNode b =a;
a和b 都指向 同一个node（1）

ex2
ListNode a = new ListNode（1）；
ListNode b = new ListNode（1）；
a 指向 node（1）
b指向 node（2）

ex2就是deepcopy，不只是copypointer本身， 而是要copynode的内容

思路呢就是简历一个hashmap 建立原list和新list之间一一对应的关系
hashmap 的key 是original node， 而hashmap的Value 是newNode
有三个步骤
1判断hashmap中是否已经copy 这个node，如果不存在，则加入hashmap
2将copy的node加入new list中，即copy next pointer
3copy当前node的randompointer
4）对original list 中的每个节点都做以上这三个操作

/*
// 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) {
        HashMap<Node,Node> map = new HashMap<>();
        
        Node cur = head;
        
        while(cur!= null){
            map.put(cur,new Node(cur.val));
            cur =cur.next;
        }
        
        cur = head;
        while(cur != null){ //通过key找value
            map.get(cur).next = map.get(cur.next);//将key的nextpointer 赋值为cur.next对应的value
            map.get(cur).random = map.get(cur.random);
            cur = cur.next;
        }
        
        return map.get(head);
    }
}