-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcopyListWithRandomPointer.java
54 lines (50 loc) · 1.48 KB
/
copyListWithRandomPointer.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/*
// Definition for a Node.
class Node {
int val;
Node next;
Node random;
public Node(int val) {
this.val = val;
this.next = null;
this.random = null;
}
}
*/
class Solution {
HashMap<Node, Node> hashMap = new HashMap<>();
public Node copyRandomList(Node head) {
if(head==null){return null;}
Node mediumHead = firstCopy(head);
return secondCopy(mediumHead, head, hashMap);
}
private Node secondCopy(Node newHead, Node oldHead, HashMap<Node,Node> hashMap){
Node oldIterator = oldHead;
Node newIterator = newHead;
while(oldIterator != null){
if(oldIterator.random == null){
oldIterator = oldIterator.next;
newIterator = newIterator.next;
continue;
}
newIterator.random = hashMap.get(oldIterator.random);
oldIterator = oldIterator.next;
newIterator = newIterator.next;
}
return newHead;
}
private Node firstCopy(Node head){
Node newHead = new Node(head.val);
Node newIterator = newHead;
hashMap.put(head, newHead);
Node iterator = head.next;
while(iterator!=null){
Node newNext = new Node(iterator.val);
newIterator.next = newNext;
hashMap.put(iterator, newNext);
newIterator = newIterator.next;
iterator = iterator.next;
}
return newHead;
}
}