首页 > 其他 > 详细

Copy List with Random Pointer

时间:2014-12-03 13:47:15      阅读:294      评论:0      收藏:0      [点我收藏+]

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) {}
 * };
 */
class Solution {
public:
    RandomListNode *copyRandomList(RandomListNode *head) {
        if(head == NULL) return NULL;
        RandomListNode *h = head;
        while(h){
            RandomListNode *node = new RandomListNode(h->label);
            node->next = h->next;
            h->next = node;
            h = h->next->next;
        }
        h = head;
        while(h){
            if(h->random)
                h->next->random = h->random->next;
            h = h->next->next;
        }
        RandomListNode *ans, *tmp;
        h = head;
        tmp = h->next;
        ans = tmp;
        h->next = h->next->next;
        h = h->next;
        while(h){
            tmp->next = h->next;
            h->next = h->next->next;
            tmp = tmp->next;
            h = h->next;
        }
        return ans;
    }
};

 

Copy List with Random Pointer

原文:http://www.cnblogs.com/code-swan/p/4139680.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!