题目描述
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针random指向一个随机节点),请对此链表进行深拷贝,并返回拷贝后的头结点。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
含有5个结点的复杂链表
![](https://img.haomeiwen.com/i13391641/8d50f34d6b21c16a.png)
复制原始链表的任意结点N并创建新结点n',在把n`连接到N的后面
![](https://img.haomeiwen.com/i13391641/4b678e2046fbfb49.png)
设置复制出来的random结点
![](https://img.haomeiwen.com/i13391641/06316a553e46c33e.png)
拆分链表
![](https://img.haomeiwen.com/i13391641/4f1ba10d5b7786c5.png)
/*
struct RandomListNode {
int label;
struct RandomListNode *next, *random;
RandomListNode(int x) :
label(x), next(NULL), random(NULL) {
}
};
*/
class Solution {
public:
RandomListNode* Clone(RandomListNode* pHead)
{
CloneNodes(pHead);
ConnectSiblingNodes(pHead);
return ReconnectNodes(pHead);
}
/*
1.复制原始链表的任意结点N并创建新结点N`,再把N`连接到N的后面
*/
void CloneNodes(RandomListNode* pHead) {
RandomListNode* pNode = pHead;
while (pNode!=NULL)
{
RandomListNode*pCloned = new RandomListNode(0);
pCloned->label = pNode->label;
pCloned->next = pNode->next;
pCloned->random = NULL;
pNode->next = pCloned;
pNode = pCloned->next;
}
}
/*
2.设置复制出来的random结点
*/
void ConnectSiblingNodes(RandomListNode* pHead) {
RandomListNode* pNode = pHead;
while (pNode!=NULL)
{
RandomListNode* pCloned = pNode->next;
if (pNode->random != NULL) {
pCloned->random = pNode->random->next;
}
pNode = pCloned->next;
}
}
/*
3.长链表拆分成两个链表
*/
RandomListNode *ReconnectNodes(RandomListNode*pHead) {
RandomListNode*pNode = pHead;
RandomListNode*pClonedHead = NULL;
RandomListNode*pCloneNode = NULL;
if (pNode != NULL) {
//取出复制链表的头
pClonedHead = pCloneNode = 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 pClonedHead;
}
};
网友评论