输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的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==nullptr)
return pHead;
//复制相同节点
RandomListNode* first = pHead;
RandomListNode* pTemp;
while(pHead){
RandomListNode* pCopy = new RandomListNode(pHead->label);
pCopy->next = pHead->next;
pHead->next = pCopy;
pHead = pCopy->next;
}
//复制随机关系
pHead = first;
while(pHead){
if(pHead->random)
{
pHead->next->random = pHead->random->next;
}
pHead = pHead->next->next;
}
//拆分
pHead = first;
first = pHead->next;
/*
while(pHead->next){
pTemp = pHead->next;
pHead->next = pTemp->next;
if(pHead->next){
pTemp->next = pHead->next->next;
pHead = pHead->next;
continue;
}
break;
}
*/
while(pHead->next){
pTemp = pHead->next;
pHead->next = pTemp->next;
// pHead = pHead->next; //出错了
pHead = pTemp;
}
return first;
}
};