【無標題】

c++:

/* // 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:
unordered_map<Node*,Node*>cachedNode;

    Node* copyRandomList(Node* head) {
    
        if(head == nullptr){
    
            return head;
        }
        if(!cachedNode.count(head)){
    
            Node* headNew = new Node(head->val);
            cachedNode[head] = headNew;
            headNew->next = copyRandomList(head->next);//遞歸
            headNew->random = copyRandomList(head->random);//遞歸
        }
        return cachedNode[head];
        
    } 
};

go:

/** * Definition for a Node. * type Node struct { * Val int * Next *Node * Random *Node * } */

var cachedNode map[*Node]*Node

func deepCopy(head *Node) *Node {
    
    if head == nil{
    
        return nil
    }
    if n,has := cachedNode[head];has{
    
        return n;
    }
    newNode := &Node{
    Val:head.Val}
    cachedNode[head] = newNode
    newNode.Next = deepCopy(head.Next)
    newNode.Random = deepCopy(head.Random)
    return cachedNode[head]
}

func copyRandomList(head *Node) *Node {
    
    cachedNode = map[*Node]*Node{
    }
    return deepCopy(head)
}