138. Copy List with Random Pointer

题目：

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.

Construct a deep copy of the list. The deep copy should consist of exactly n brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the next and random pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.

For example, if there are two nodes X and Y in the original list, where X.random --> Y, then for the corresponding two nodes x and y in the copied list, x.random --> y.

Return the head of the copied linked 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) that the random pointer points to, or null if it does not point to any node.

Your code will only be given the head of the original linked list.

 

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: The given linked list is empty (null pointer), so return null.

 

Constraints:

• 0 <= n <= 1000
• -10000 <= Node.val <= 10000
• Node.random is null or is pointing to some node in the linked list.

 

 

 

 

思路：

这题因为是需要同时记录next和random，但是在按序遍历的时候，很可能random的那个还没创建，因此采用递归是最为合适而且思路清晰的。创建一个哈希表来存放已经原本的Node作为key，然后存放创建的Node作为value。首先判断是否为空，为空直接返回，然后是否已经创建，已经创建则直接从哈希map中找结果即可，两者都不是，就创建新node然后一次call recursion来创建next和random，最后返回root即可。

 

 

 

 

 

代码：

/*
// 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)
            return NULL;
        if(m.count(head))
            return m[head];
        Node* root=new Node(head->val);
        m[head]=root;
        root->next=copyRandomList(head->next);
        root->random=copyRandomList(head->random);
        return root;
    }
private:
    unordered_map<Node*,Node*> m;
};