-
Notifications
You must be signed in to change notification settings - Fork 169
/
Solution.java
38 lines (29 loc) · 1.07 KB
/
Solution.java
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
/**
* Definition for singly-linked list with a random pointer.
* class RandomListNode {
* int label;
* RandomListNode next, random;
* RandomListNode(int x) { this.label = x; }
* };
*/
public class Solution {
public RandomListNode copyRandomList(RandomListNode head) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if(head == null) return null;
HashMap<RandomListNode, RandomListNode> map = new HashMap<RandomListNode, RandomListNode>();
RandomListNode iter = head;
while(iter != null){
RandomListNode born = new RandomListNode(iter.label);
map.put(iter, born);
iter = iter.next;
}
iter = head;
while(iter != null){
RandomListNode islet = map.get(iter);
islet.next = map.get(iter.next);
islet.random = map.get(iter.random);
iter = iter.next;
}
return map.get(head);
}
}