题目描述
给出一个链表,使每个节点包含一个附加的随机指针,该指针可以指向列表中的任何节点或null。返回列表的深度拷贝副本
解题思路
(1)拷贝新节点,并插入到原节点的后边
(2)拷贝新节点的随机指针
(3)将新节点从原链表中分离出来
代码示例
1、low版
class Solution {
public:
RandomListNode *copyRandomList(RandomListNode *head) {
if (head == NULL || head->next == NULL) {
return head;
}
RandomListNode *p = head;
while (p) {
RandomListNode *temp = p->next;
RandomListNode *q = new RandomListNode(p->label);
p->next = q;
q->next = temp;
p = p->next->next;
}
RandomListNode *r = head;
while (r) {
r->next->random = (r->random ?r->random->next : NULL);
r = r->next->next;
}
RandomListNode *res = head->next;
RandomListNode *s = head->next;
while (s) {
s->next = (s->next ? s->next->next : NULL);
s = s->next;
}
return res;
}
};
缺点:存在很多没必要的变量,如r、s其作用和p一样,应考虑如何精简,此外while循环也可以考虑使用for循环进行精简
2、high版
class Solution {
public:
RandomListNode *copyRandomList(RandomListNode *head) {
if (head == NULL || head->next == NULL) {
return head;
}
RandomListNode *p;
for (p = head; p; p = p->next->next) {
RandomListNode *copy = new RandomListNode(p->label);
copy->next = p->next;
p->next = copy;
}
for (p = head; p; p = p->next->next) {
p->next->random = (p->random ? p->random->next : NULL);
}
for (p = head->next; p; p = p->next) {
p->next = (p->next ? p->next->next : NULL);
}
return head->next;
}
};