剑指offer---复杂链表复制

剑指offer面试题---复杂链表复制

分析此题：1.首先要将链表的每一个节点复制一份，连在被复制节点后面。

                   2.将对应的指向关系也对应复制。

                   3.分离原链表、复制链表。



代码实现：

struct ComplexListNode
{
int _data;
ComplexListNode* _next;
ComplexListNode* _sibling;
};

1.将链表的每一个节点复制一份，连在被复制节点后面。

void CloneNode(ComplexListNode*pHead)
{
ComplexListNode*pNode = pHead;
while (pNode != NULL)
{
ComplexListNode*pClone = new ComplexListNode();
pClone->_data = pNode->_data;
pClone->_next = pNode->_next;
pClone->_sibling = NULL;

pNode->_next = pClone;
pNode = pClone->_next;
}
}2.将对应的指向关系也对应复制

void ConnectSiblingNode(ComplexListNode*pHead)
{
ComplexListNode*pNode = pHead;
while (pNode != NULL)
{
ComplexListNode*pClone = pNode->_next;
if (pNode->_sibling != NULL)
{
pClone->_sibling = pNode->_sibling->_next;
}
}
}

3.分离原链表、复制链表

ComplexListNode* ReconnectNode(ComplexListNode*pHead)
{
ComplexListNode*pNode = pHead;
ComplexListNode*pCloneHead = NULL;
ComplexListNode*pCloneNode = NULL;
if (pNode!=NULL)
{
pCloneHead = 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 pCloneHead;
}
ComplexListNode*Clone(ComplexListNode*pHead)
{
CloneNode(pHead);
ConnectSiblingNode(pHead);
return ReconnectNode(pHead);
}