-
Notifications
You must be signed in to change notification settings - Fork 0
/
138.cpp
60 lines (53 loc) · 1.39 KB
/
138.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <vector>
#include <map>
using namespace std;
// 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:
RandomListNode *copyRandomList(RandomListNode *head)
{
if(head==NULL)
return NULL;
else
{
map<RandomListNode *,RandomListNode *> m1;
RandomListNode *cur=head;
RandomListNode *new_head=new RandomListNode(cur->label);
RandomListNode *new_cur=new_head;
new_cur->random=cur->random;
m1[cur]=new_cur;
while(cur->next)
{
RandomListNode *temp=new RandomListNode(cur->next->label);
new_cur->next=temp;
new_cur=new_cur->next;
cur=cur->next;
new_cur->random=cur->random;
m1[cur]=new_cur;
}
cur=head;
new_cur=new_head;
while(new_cur)
{
if(new_cur->random!=NULL)
{
new_cur->random=m1[new_cur->random];
}
new_cur=new_cur->next;
}
return new_head;
}
}
};
int main()
{
return 0;
}