题目描述
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的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)
return NULL;
RandomListNode* pNode = pHead;
RandomListNode* copyNode;
while (pNode) {
copyNode = new RandomListNode(pNode->label);
copyNode->next = pNode->next;
pNode->next = copyNode;
pNode = copyNode->next;
}
pNode = pHead;
while (pNode) {
copyNode = pNode->next;
if(pNode->random)
copyNode->random = pNode->random->next;
pNode = copyNode->next;
}
RandomListNode* copyHead = pHead->next;
RandomListNode* currentNode = pHead;
RandomListNode* successor;
while (currentNode->next) {
successor = currentNode->next;
currentNode->next = successor->next;
currentNode = successor;
}
return copyHead;
}
};