剑指offer:面试题27——二叉搜索树与双向链表
题目:输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
/*
struct RandomListNode {
int label;
struct RandomListNode *next, *random;
RandomListNode(int x) :
label(x), next(NULL), random(NULL) {
}
};
*/
class Solution {
public:
void LinkNext(RandomListNode* pHead)
{
//RandomListNode* pOldHead=pHead;
RandomListNode* pNewHead=pHead;
while(pNewHead!=NULL)
{
int label=pNewHead->label;
RandomListNode *pTmpNode = new RandomListNode(pNewHead->label);
pTmpNode->label=pNewHead->label;
pTmpNode->next=pNewHead->next;
pTmpNode->random=NULL;
pNewHead->next=pTmpNode;
pNewHead=pTmpNode->next;
}
}
public:
void CopySibling(RandomListNode* pHead)
{
RandomListNode *pNewHead=pHead;
while(pNewHead!=NULL)
{
if(pNewHead->random!=NULL)
pNewHead->next->random=pNewHead->random->next;
pNewHead=pNewHead->next->next;
}
}
public:
RandomListNode* SeperateList(RandomListNode* pHead)
{
RandomListNode* pNode = pHead;
RandomListNode* pCloneHead=NULL;
RandomListNode* pCloneNode=NULL;
if(pNode!=NULL)
{
pCloneNode=pCloneHead=pNode->next;
pNode->next=pCloneNode->next;
pNode=pNode->next;
}
while(pNode!=NULL)
{
pCloneNode->next=pNode->next;
pCloneNode=pCloneNode->next;
pNode->next=pCloneNode->next;
pNode=pNode->next;
}
return pCloneHead;
}
public:
RandomListNode* Clone(RandomListNode* pHead)
{
if(pHead==NULL)return nullptr;
LinkNext(pHead);
CopySibling(pHead);
return SeperateList(pHead);
}
};