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.
三步走
1-复制结点
2-复制随机结点
3-拆解
这里有三个地方要注意判断是否是空
/**
* 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 head;
//copy
RandomListNode *p = head;
while (p) {
RandomListNode *q = new RandomListNode(p->label);
q->next = p->next;
p->next = q;
p = q->next;
}
RandomListNode *q = NULL;
//copy randomNode
p = head, q = p->next;
while (p) {
if(p->random)/
q->random = p->random->next;
p = q->next;
if(p)//
q = p->next;
}
//broken
RandomListNode *tmp_head = head->next;
p = head, q = p->next;
while (p) {
p->next = q->next;
p = q->next;
if (p) {///
q->next = p->next;
q = p->next;
}
}
return tmp_head;
}
};