思路
- 將新結點放在老結點的后面
- 復制random
- 將鏈表拆開
/*
// Definition for a Node.
class Node {
public:int val;Node* next;Node* random;Node() {}Node(int _val, Node* _next, Node* _random) {val = _val;next = _next;random = _random;}
};
*/
class Solution {
public:Node* copyRandomList(Node* head) {if (head == NULL){return NULL;}Node *cur = head;while (cur != NULL){//新結點跟在老結點后面Node *node = (Node *)malloc(sizeof(Node));node->val = cur->val;node->random = NULL;Node *next = cur->next;cur->next = node;node->next = next; //原來cur->nextcur = next;}//復制randomcur = head;while (cur != NULL){Node *node = cur->next;if (cur->random != NULL){node->random = cur->random->next;}cur = node->next;}//拆開cur = head;Node *ret = head->next;while (cur != NULL){Node *node = cur->next;cur->next = node->next;if (node->next != NULL){node->next = cur->next->next;}cur = cur->next;}return ret;}
};
)
)
)
)
