自然的想法是利用Hash,先把原链表从头到尾扫一次,扫的过程中生成新的节点,并且建立这样的映射表,<原链表节点,对应的新生成的节点>。在扫第二次的时候,根据原链表的链接关系把新生成的链表节点连好就好了。
/**
* 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)
return head;
map<RandomListNode *, RandomListNode *> myMap;
RandomListNode *p = head;
while (p != NULL) {
RandomListNode *t = new RandomListNode(p->label);
myMap[p] = t;
p = p->next;
}
p = head;
while (p != NULL) {
if (p->next != NULL)
myMap[p]->next = myMap[p->next];
if (p->random != NULL)
myMap[p]->random = myMap[p->random];
p = p->next;
}
return myMap[head];
}
};
当然如果想不使用额外的空间,那么就要利用好已有的指针空间来存放一些信息,下面这个博客讲得很清楚了。
http://www.cnblogs.com/lautsie/p/3259724.html
题目要求原链表也不能被改动,因此最后还得有一个重建原链表的过程。
/**
* 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)
return head;
RandomListNode *p = head;
while (p != NULL) {
RandomListNode *t = new RandomListNode(p->label);
t->next = p->next;
p->next = t;
p = t->next;
}
p = head;
while (p != NULL) {
RandomListNode *t = p->next;
if (p->random != NULL)
t->random = p->random->next;
p = p->next->next;
}
p = head;
RandomListNode *res = p->next;
while (p != NULL) {
RandomListNode *t = p->next;
p->next = t->next;
p = p->next;
if (p != NULL)
t->next = p->next;
}
return res;
}
};
http://oj.leetcode.com/problems/copy-list-with-random-pointer/