复杂链表的复制

最新推荐文章于 2023-06-16 13:23:16 发布

szl_lxy

最新推荐文章于 2023-06-16 13:23:16 发布

阅读量269

点赞数

分类专栏：剑指offer

本文链接：https://blog.csdn.net/szl_lxy/article/details/48134559

版权

剑指offer 专栏收录该内容

67 篇文章 0 订阅

订阅专栏

题目描述

输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点）。

#include <iostream>
#include "ComplexList.h"

using namespace std;

void CopyNext(ComplexListNode* pHead)
{
	ComplexListNode* pNode = pHead;
	while(pNode != NULL)
	{
		ComplexListNode* pCloned = new ComplexListNode();
		pCloned ->m_nValue = pNode ->m_nValue;
		pCloned ->m_pNext = pNode ->m_pNext;
		pCloned ->m_pSibling = NULL;

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

void CopySlibing (ComplexListNode* pHead)
{
	ComplexListNode* pNode = pHead;

	while(pNode != NULL)
	{
		ComplexListNode* pCloned = pNode ->m_pNext;
		if(pNode ->m_pSibling != NULL)
			pCloned ->m_pSibling = pNode ->m_pSibling->m_pNext;

		pNode = pCloned ->m_pNext;
	}
}
ComplexListNode* ReconnetNodes(ComplexListNode* pHead)
{
	ComplexListNode* pNode = pHead;
	ComplexListNode* pClonedHead = NULL;
	ComplexListNode* pCloned = NULL;

	if(pNode != NULL)
	{
		pClonedHead = pNode ->m_pNext;
		pCloned = pClonedHead;
		pNode ->m_pNext = pCloned ->m_pNext;
		pNode = pNode ->m_pNext;
	}
	while (pNode != NULL)
	{
		pCloned ->m_pNext = pNode ->m_pNext;
		pCloned = pCloned ->m_pNext;
		pNode ->m_pNext = pCloned ->m_pNext;
		pNode = pNode ->m_pNext;
	}

	return pClonedHead;
}
ComplexListNode* Clone(ComplexListNode* pHead)
{
	 CopyNext(pHead);
	 CopySlibing (pHead);
	return  ReconnetNodes(pHead);
}

// ====================测试代码====================
void Test(char* testName, ComplexListNode* pHead)
{
    if(testName != NULL)
        printf("%s begins:\n", testName);

    printf("The original list is:\n");
    PrintList(pHead);

    ComplexListNode* pClonedHead = Clone(pHead);

    printf("The cloned list is:\n");
    PrintList(pClonedHead);
}

//          -----------------
//         \|/              |
//  1-------2-------3-------4-------5
//  |       |      /|\             /|\
//  --------+--------               |
//          -------------------------
void Test1()
{
    ComplexListNode* pNode1 = CreateNode(1);
    ComplexListNode* pNode2 = CreateNode(2);
    ComplexListNode* pNode3 = CreateNode(3);
    ComplexListNode* pNode4 = CreateNode(4);
    ComplexListNode* pNode5 = CreateNode(5);

    BuildNodes(pNode1, pNode2, pNode3);
    BuildNodes(pNode2, pNode3, pNode5);
    BuildNodes(pNode3, pNode4, NULL);
    BuildNodes(pNode4, pNode5, pNode2);

    Test("Test1", pNode1);
}

// m_pSibling指向结点自身
//          -----------------
//         \|/              |
//  1-------2-------3-------4-------5
//         |       | /|\           /|\
//         |       | --             |
//         |------------------------|
void Test2()
{
    ComplexListNode* pNode1 = CreateNode(1);
    ComplexListNode* pNode2 = CreateNode(2);
    ComplexListNode* pNode3 = CreateNode(3);
    ComplexListNode* pNode4 = CreateNode(4);
    ComplexListNode* pNode5 = CreateNode(5);

    BuildNodes(pNode1, pNode2, NULL);
    BuildNodes(pNode2, pNode3, pNode5);
    BuildNodes(pNode3, pNode4, pNode3);
    BuildNodes(pNode4, pNode5, pNode2);

    Test("Test2", pNode1);
}

// m_pSibling形成环
//          -----------------
//         \|/              |
//  1-------2-------3-------4-------5
//          |              /|\
//          |               |
//          |---------------|
void Test3()
{
    ComplexListNode* pNode1 = CreateNode(1);
    ComplexListNode* pNode2 = CreateNode(2);
    ComplexListNode* pNode3 = CreateNode(3);
    ComplexListNode* pNode4 = CreateNode(4);
    ComplexListNode* pNode5 = CreateNode(5);

    BuildNodes(pNode1, pNode2, NULL);
    BuildNodes(pNode2, pNode3, pNode4);
    BuildNodes(pNode3, pNode4, NULL);
    BuildNodes(pNode4, pNode5, pNode2);

    Test("Test3", pNode1);
}

// 只有一个结点
void Test4()
{
    ComplexListNode* pNode1 = CreateNode(1);
    BuildNodes(pNode1, NULL, pNode1);

    Test("Test4", pNode1);
}

// 鲁棒性测试
void Test5()
{
    Test("Test5", NULL);
}

int main(int argc, char* argv[])
{
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();

    return 0;
}