输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点），返回结果为复制后复杂链表的head。（注意，输出结果中请不要返回参数中的节点引用，否则判题程序会直接返回空）
struct RandomListNode {
int label;
struct RandomListNode *next, *random;
RandomListNode(int x) :
label(x), next(NULL), random(NULL) {
}
};
class Solution {
public:
void CloneNodes(RandomListNode* pHead)
{
RandomListNode* p = pHead;
while(p != NULL)
{
RandomListNode* newNode = new RandomListNode(p->label);
newNode->next = p->next;
newNode->random = NULL; // 不能指向p->random
p->next = newNode;
p = newNode->next;
}
}
void ConnectRanNodes(RandomListNode* pHead)
{
RandomListNode *p = pHead;
while(p != NULL)
{
RandomListNode* q = p->next;
if(p->random != NULL)
{
q->random = p->random->next;
p = q->next;
}
}
}
RandomListNode* SplitNodes(RandomListNode* pHead)
{
RandomListNode* p = pHead;
RandomListNode* cloneNodes = NULL;
RandomListNode* newNodes = NULL;
if(p != NULL)
{
cloneNodes = newNodes = p->next;
p->next = newNodes->next;
p = p->next;
}
while(p != NULL)
{
newNodes->next = p->next;
newNodes = newNodes->next;
p->next = newNodes->next;
p = p->next;
}
return cloneNodes;
}
RandomListNode* Clone(RandomListNode* pHead)
{ /*
if(pHead == NULL) return NULL;
CloneNodes(pHead);
ConnectRanNodes(pHead);
return SplitNodes(pHead);
*/
if(pHead == NULL) return pHead;
RandomListNode* res = new RandomListNode(0);
RandomListNode* rnode = res; //复制的链表指针
RandomListNode* pnode = pHead; //原来的链表指针
while(pnode != nullptr){
RandomListNode* temp = new RandomListNode(pnode->label);
book[pnode] = temp; // 建立图表
rnode->next = temp;
rnode = rnode->next;
pnode=pnode->next;
}
pnode = pHead;
rnode = res->next;
while(pnode != nullptr){
rnode->random = book[pnode->random];
rnode = rnode->next;
pnode = pnode->next;
}
return res->next;
}
private:
map<RandomListNode*,RandomListNode*> book;
};