題目：

　　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.

解題思路：

　　采用遞歸求解，并利用unordered_map來記錄新生成的節點。

代碼：

/*** Definition for singly-linked list with a random pointer.* struct RandomListNode {* int label;* RandomListNode *next, *random;* RandomListNode(int x) : label(x), next(NULL), random(NULL) {}* };*/ class Solution { public:unordered_map<int, RandomListNode*> dict;RandomListNode *copyRandomList(RandomListNode *head) {if (head == NULL || dict.count(head->label)) return NULL;RandomListNode *new_head = new RandomListNode(head->label);dict[head->label] = new_head;if (head->next != NULL) {copyRandomList(head->next);new_head->next = dict[head->next->label];}if (head->random != NULL) {copyRandomList(head->random);new_head->random = dict[head->random->label];}return new_head;} };

?

轉載于:https://www.cnblogs.com/dongguangqing/p/3727129.html

總結

以上是生活随笔為你收集整理的LeetCode OJ - Copy List with Random Pointer的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。