(个人水平有限,请见谅!)
题目描述:
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的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 == NULL)
return NULL;
// 在旧链表中每个节点中创建新节点,赋相同初值
RandomListNode* currentNode = pHead;
while (currentNode != NULL)
{
RandomListNode* cloneNode = new RandomListNode(currentNode->label);
//RandomListNode* nextNode = new RandomListNode(currentNode->next);
cloneNode->next = currentNode->next;
currentNode->next = cloneNode;
currentNode = cloneNode->next;
//cloneNode->random = currentNode->random->next;
}
// 将旧链表节点的随机指针赋给新节点
currentNode = pHead;
while (currentNode != NULL)
{
if (currentNode->random != NULL)
currentNode->next->random = currentNode->random->next;
else
currentNode->next->random = NULL;
currentNode = currentNode->next->next;
}
// 拆分链表
currentNode = pHead;
RandomListNode* clonepHead = pHead->next;
while (currentNode != NULL)
{
RandomListNode* cloneNode = currentNode->next;
currentNode->next = cloneNode->next;
if (cloneNode->next != NULL)
cloneNode->next = cloneNode->next->next;
else
cloneNode->next = NULL;
currentNode = currentNode->next;
}
return clonepHead;
}
};