题目
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下
一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复
杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,
否则判题程序会直接返回空)
/*
struct RandomListNode {
int label;
struct RandomListNode *next, *random;
RandomListNode(int x) :
label(x), next(NULL), random(NULL) {
}
};
*/
class Solution {
public:
RandomListNode* Clone(RandomListNode* pHead)
{
if(!pHead)
return NULL;
RandomListNode * cur;
cur = pHead;
//建立新链表A->A'->B->B'->C->C'
while(cur)
{
RandomListNode * node = new RandomListNode(cur->label);
node->next = cur->next;
cur->next = node;
cur = node->next;
}
cur = pHead;
RandomListNode * p;
while(cur)
{
p = cur->next;
if(cur->random)
{
p->random = cur->random->next;
}
cur = p->next;
}
RandomListNode * tmp;
RandomListNode *pReNode = pHead->next;
cur = pHead;
while(cur->next)
{
tmp = cur->next;
cur->next = tmp->next;
cur = tmp;
}
return pReNode;
}
};