leetcode/CopyListwithRandomPointer.java at master · Susheng/leetcode · GitHub

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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}
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


/**
 * 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.
 */

publicclassCopyListwithRandomPointer {
publicRandomListNodecopyRandomList(RandomListNodehead) {
if (head == null)
returnhead;
RandomListNodecur = head;
while (cur != null) {
RandomListNodenewNode = newRandomListNode(cur.label);
newNode.next = cur.next;
cur.next = newNode;
cur = newNode.next;
 }
cur = head;
while (cur != null) {
if (cur.random != null) {
cur.next.random = cur.random.next;
 }
cur = cur.next.next;
 }
cur = head.next;
RandomListNodenewHead = cur;
RandomListNodeold = head;
while (old != null) {
old.next = old.next.next;
if (old.next != null) {
cur.next = old.next.next;
 }
cur = cur.next;
old = old.next;
 }
returnnewHead;
	}
}