给定一个链表,每个节点包含一个额外增加的随机指针,该指针可以指向链表中的任何节点或空节点。
要求返回这个链表的深度拷贝。
/**
* Definition for singly-linked list with a random pointer.
* class RandomListNode {
* int label;
* RandomListNode next, random;
* RandomListNode(int x) { this.label = x; }
* };
1. 在原链表的每个节点后面拷贝出一个新的节点
2. 依次给新的节点的随机指针赋值,而且这个赋值非常容易 cur->next->random = cur->random->next
3. 断开链表可得到深度拷贝后的新链表
*/
public class Solution {
public RandomListNode copyRandomList(RandomListNode head) {
if (head==null) return null;
RandomListNode cur = head;
while (cur!=null) {
RandomListNode node = new RandomListNode(cur.label);
node.next = cur.next;
cur.next = node;
cur = node.next;
}
cur = head;
while (cur!=null) {
if (cur.random!=null) {
cur.next.random = cur.random.next;
}
cur = cur.next.next;
}
cur = head;
RandomListNode res = head.next;
while (cur!=null) {
RandomListNode tmp = cur.next;
cur.next = tmp.next;
if(tmp.next!=null) tmp.next = tmp.next.next;
cur = cur.next;
}
return res;
}
}