leetcode, LC13: copy-list-with-random-pointer

1 题目描述

现在有一个这样的链表：链表的每一个节点都附加了一个随机指针，随机指针可能指向链表中的任意一个节点或者指向空。
请对这个链表进行深拷贝。
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.

2 解题思路

1. 复制next结点
2. 复制random结点
3. 剥离重复结点

3 代码实现

/**
 * 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 *currNodeOfCopiedRandomList;
        RandomListNode *currNodeOfOriginRandomList;
        
        for(currNodeOfOriginRandomList = head; currNodeOfOriginRandomList != NULL; currNodeOfOriginRandomList = currNodeOfOriginRandomList->next){
            currNodeOfCopiedRandomList = new RandomListNode(currNodeOfOriginRandomList->label);
            currNodeOfCopiedRandomList->next = currNodeOfOriginRandomList->next;
            currNodeOfOriginRandomList->next = currNodeOfCopiedRandomList;
            
            currNodeOfOriginRandomList = currNodeOfOriginRandomList->next;
        }
        for(currNodeOfOriginRandomList = head; currNodeOfOriginRandomList != NULL; currNodeOfOriginRandomList = currNodeOfCopiedRandomList->next){
            currNodeOfCopiedRandomList = currNodeOfOriginRandomList->next;
            currNodeOfCopiedRandomList->random = (currNodeOfOriginRandomList->random != NULL ? currNodeOfOriginRandomList->random->next : NULL);
        }
        RandomListNode *pre;
        RandomListNode *pos;
        for(pre = head, pos = pre->next; pre != NULL;){
            pre->next = pos->next;
            pre = pre->next;
            pos->next = (pre != NULL ? pre->next : NULL);
            pos = pos->next;
        }
        return head;
    }
};

4 运行结果

运行时间：11ms
占用内存：1400k