复杂链表的复制

struct ComplexListNode
{
int m_val;
ComplexListNode* m_pNext;
ComplexListNode* m_pSibling;
};
void CloneNodes(ComplexListNode* pHead)
{
ComplexListNode* pNode = pHead;
while(pNode != NULL)
{
ComplexListNode* pCloned = new ComplexListNode();
pCloned->m_val = pNode->m_val;
pCloned->m_pNext = pNode->m_pNext;
pCloned->m_pSibling = NULL;

    pNode->m_pNext = pCloned;
    pNode = pCloned->m_pNext;
}

}
void ConnectsiblingNodes(ComplexListNode* pHead)
{
ComplexListNode* pNode = pHead;
while(pNode != NULL)
{
ComplexListNode* pClonded = pNode->m_pNext;
if(pClonded != NULL)
{
pClonded->m_pSibling = pNode->m_pSibling->m_pNext;
}
pNode = pClonded->m_pNext;
}
}
ComplexListNode* ReconnectNodes(ComplexListNode* pHead)
{
ComplexListNode* pNode = pHead;
ComplexListNode* pCloneHead = NULL;
ComplexListNode* pCloneNode = NULL;

if(pNode != NULL)
{
    pCloneHead = pCloneNode = pNode->m_pNext;
    pNode->m_pNext = pCloneNode->m_pNext;
    pNode = pNode->m_pNext;
}
while(pNode != NULL)
{
    pCloneNode->m_pNext = pNode->m_pNext;
    pCloneNode = pCloneNode->m_pNext;
    pNode->m_pNext = pCloneNode->m_pNext;
    pNode = pNode->m_pNext;
}
return pCloneHead;

}
ComplexListNode* Clone(ComplexListNode* pHead)
{
CloneNodes(pHead);
ConnectsiblingNodes(pHead);
return ReconnectNodes(pHead);
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值