题目
题解:
一刷时采用的是《剑指offer》中,在原链表中插入新复制的节点,从而在复制random节点时,不需要开辟额外的辅助空间。
- 复制节点,并将复制的节点插入原来的链表中。
- 将新节点的random节点复制给新的节点。
时间复杂度:O(n)
空间复杂度:O(1)
/*
// Definition for a Node.
class Node {
public:
int val;
Node* next;
Node* random;
Node(int _val) {
val = _val;
next = NULL;
random = NULL;
}
};
*/
class Solution {
public:
Node* copyRandomList(Node* head) {
if(head == NULL)return NULL;
Node* cur = head;
//复制链表并插入
while(cur != NULL)
{
Node* tmp = cur->next;
Node* newNode = new Node(cur->val);
cur->next = newNode;
newNode->next = tmp;
cur = cur->next->next;
}
cur = head;
Node* node = head->next;
//复制random
while(cur != NULL)
{
if(cur->random != NULL)
node->random = cur->random->next;
cur = cur->next->next;
if(node->next !=NULL)
node = node->next->next;
}
cur = head;
node = head->next;
Node* newHead = node;
//分离两个链表
while(cur != NULL)
{
cur->next = cur->next->next;
cur = cur->next;
if(node->next != NULL)
{
node->next = node->next->next;
node = node->next;
}
}
return newHead;
}
};