// 面試題35：復雜鏈表的復制 // 題目：請實現函數ComplexListNode* Clone(ComplexListNode* pHead)，復 // 制一個復雜鏈表。在復雜鏈表中，每個結點除了有一個m_pNext指針指向下一個 // 結點外，還有一個m_pSibling 指向鏈表中的任意結點或者nullptr。 #include <iostream> #include "ComplexList.h"void CloneNodes(ComplexListNode* pHead); void ConnectSiblingNodes(ComplexListNode* pHead); ComplexListNode* ReconnectNodes(ComplexListNode* pHead);ComplexListNode* Clone(ComplexListNode* pHead) {CloneNodes(pHead);ConnectSiblingNodes(pHead);return ReconnectNodes(pHead); }void CloneNodes(ComplexListNode* pHead)//將原鏈表每個節點復制一下，接在這個節點的后面，此時不設置m_pSibling {ComplexListNode* pNode = pHead;while (pNode != nullptr){ComplexListNode* pCloned = new ComplexListNode();pCloned->m_nValue = pNode->m_nValue;pCloned->m_pNext = pNode->m_pNext;pCloned->m_pSibling = nullptr;pNode->m_pNext = pCloned;pNode = pCloned->m_pNext;} }void ConnectSiblingNodes(ComplexListNode* pHead)//設置m_pSibling，設置的方式就是第45行 {ComplexListNode* pNode = pHead;while (pNode != nullptr){ComplexListNode* pCloned = pNode->m_pNext;if (pNode->m_pSibling != nullptr){pCloned->m_pSibling = pNode->m_pSibling->m_pNext;}pNode = pCloned->m_pNext;} }ComplexListNode* ReconnectNodes(ComplexListNode* pHead)//把偶數位的pCloned抽出來 {ComplexListNode* pNode = pHead;ComplexListNode* pClonedHead = nullptr;ComplexListNode* pClonedNode = nullptr;if (pNode != nullptr){pClonedHead = pClonedNode = pNode->m_pNext;pNode->m_pNext = pClonedNode->m_pNext;pNode = pNode->m_pNext;}while (pNode != nullptr){pClonedNode->m_pNext = pNode->m_pNext;pClonedNode = pClonedNode->m_pNext;pNode->m_pNext = pClonedNode->m_pNext;pNode = pNode->m_pNext;}return pClonedHead; }// ====================測試代碼==================== void Test(const char* testName, ComplexListNode* pHead) {if (testName != nullptr)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, nullptr);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, nullptr);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, nullptr);BuildNodes(pNode2, pNode3, pNode4);BuildNodes(pNode3, pNode4, nullptr);BuildNodes(pNode4, pNode5, pNode2);Test("Test3", pNode1); }// 只有一個結點 void Test4() {ComplexListNode* pNode1 = CreateNode(1);BuildNodes(pNode1, nullptr, pNode1);Test("Test4", pNode1); }// 魯棒性測試 void Test5() {Test("Test5", nullptr); }int main(int argc, char* argv[]) {Test1();Test2();Test3();Test4();Test5();system("pause");return 0; }

?文件ComplexList.h

struct ComplexListNode {int m_nValue;ComplexListNode* m_pNext;ComplexListNode* m_pSibling; };ComplexListNode* CreateNode(int nValue); void BuildNodes(ComplexListNode* pNode, ComplexListNode* pNext, ComplexListNode* pSibling); void PrintList(ComplexListNode* pHead);

?文件ComplexList.cpp

#include <iostream> #include "ComplexList.h"ComplexListNode* CreateNode(int nValue) {ComplexListNode* pNode = new ComplexListNode();pNode->m_nValue = nValue;pNode->m_pNext = nullptr;pNode->m_pSibling = nullptr;return pNode; }void BuildNodes(ComplexListNode* pNode, ComplexListNode* pNext, ComplexListNode* pSibling) {if(pNode != nullptr){pNode->m_pNext = pNext;pNode->m_pSibling = pSibling;} }void PrintList(ComplexListNode* pHead) {ComplexListNode* pNode = pHead;while(pNode != nullptr){printf("The value of this node is: %d.\n", pNode->m_nValue);if(pNode->m_pSibling != nullptr)printf("The value of its sibling is: %d.\n", pNode->m_pSibling->m_nValue);elseprintf("This node does not have a sibling.\n");printf("\n");pNode = pNode->m_pNext;} }

?

轉載于:https://www.cnblogs.com/CJT-blog/p/10494280.html

總結

以上是生活随笔為你收集整理的《剑指offer》第三十五题（复杂链表的复制）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。