leetcode - Copy List with Random Pointer

標籤：style   color   io   ar   for   on   c   ad   line   

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.

/** * 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) {} * }; */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;//將oldList的每一個節點之後，插入一個newNode.RandomListNode *oldListNode = head;while(oldListNode != NULL){RandomListNode *newListNode = new RandomListNode(oldListNode->label);newListNode->next = oldListNode->next;newListNode->random = oldListNode->random;oldListNode->next = newListNode;oldListNode = oldListNode->next->next;}//update newListNode上的random結點關聯的結點oldListNode = head;while(oldListNode != NULL){if(oldListNode->random != NULL){oldListNode->next->random = oldListNode->random->next;}oldListNode = oldListNode->next->next;}//分離oldListNode與newListNodeRandomListNode *newListNode = new RandomListNode(0);newListNode->next = head;oldListNode = head;RandomListNode *resultListNode = newListNode;while(oldListNode != NULL){newListNode->next = oldListNode->next;oldListNode->next = newListNode->next->next;newListNode = newListNode->next;oldListNode = oldListNode->next;}return resultListNode->next;    }};

leetcode - Copy List with Random Pointer