分析
采用unordered_map[key,value]来记录
key:原链表节点
value:新链表节点
因此map[key]的值就是value,即新节点;
/*
// 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 == NULL) return head;
//map中存的是(原节点,拷贝节点)的一个映射
unordered_map<Node*,Node*> map;
Node* cur = head;
//遍历原链表,为新链表申请节点空间并为val赋值
while(cur){ //map[cur]就是新结点
map[cur] = new Node(cur->val);//为新节点申请空间
cur = cur->next;
}
//遍历原链表,为新链表节点next,random域赋值
cur = head;
while(cur){
map[cur]->next = map[cur->next];
map[cur]->random = map[cur->random];
cur = cur->next;
}
return map[head];
}
};