ljx_5489464的博客

题目：请实现函数ComplexNode* Clone(ComplexNode* pHead)，复制一个复杂链表。在复杂链表中，每个结点除了有一个m_pNext指针指向下一个结点外，还有一个m_pSibling指向链表中的任一结点或者NULL。其结点的C++定义如下：struct ComplexNode{int m_nValue;ComplexNode* m_pNext;ComplexNode* m_

//链表相交时的交点PSListNode IntersectionNode(PSListNode pL1, PSListNode pL2){ int count1 = 0; int count2 = 0; PSListNode PSList1 = pL1; PSListNode PSList2 = pL2; PSListNode pMeetNode1 =

int IsListCroseWithCycle(PSListNode pL1, PSListNode pL2){ PSListNode pMeetNode1 = HasCycle(pL1); PSListNode pMeetNode2 = HasCycle(pL2); if ((NULL == pL1) || (NULL == pL2)) { re

int IsListCrose(PSListNode pL1, PSListNode pL2){ if ((NULL == pL1) || (NULL == pL2)) { return 0; } else { PSListNode PSList1 = pL1; PSListNode PSList2 = pL2

PSListNode HasCycle(PSListNode pHead){ if ((NULL == pHead) || (NULL == pHead->pNextNode)) { return NULL; } else { PSListNode pFast = pHead->pNextNode->pNextNode;

PSListNode FindLastKNode(PSListNode pHead, int K){ if ((NULL == pHead) || (K <= 0)) { return NULL; } else { PSListNode pFast = pHead; PSListNode pSlow = pHe

PSListNode FindMidNode(PSListNode pHead){ if (NULL == pHead) { return NULL; } else { //快慢指针，快指针一次循环走两步，慢指针一次循环走一步 PSListNode pSlow = pHead; PSListNo

PSListNode MergeList(PSListNode pL1, PSListNode pL2){ PSListNode pNewNode = NULL; PSListNode pListNode1 = pL1; PSListNode pListNode2 = pL2; PSListNode pNode = NULL; if (NULL == pLi

优化版：void SortList(PSListNode pHead){ if (NULL == pHead) { return; } else { int flag = 0; PSListNode pTailNode = NULL; //当设置的尾节点与头结点指向同一个节点时，说明只...

1、逆置链表：前插法void ReverseList(PSListNode* pHead){ if (NULL == *pHead) { return; } else { //创建一个新的空链表，遍历pHead指向的链表里的所有节点，每找到一个，就前插到新链表里 PSListNode pNewHead = *pHead; *pHea

//使链表形成一个环void FormCyc(PSListNode *pHead){ if (NULL == pHead) { return; } else { PSListNode pNode = *pHead; while (NULL != (pNode->pNextNode)) {

①时间复杂度为N：void InsertNotHead(PSListNode pHead, PSListNode pos, DataType data){ PSListNode pPreNode = pHead; PSListNode pPreNode = pHead; if (NULL == pos) { return; } els

void DelNotTailNode(PSListNode pos){ PSListNode pNode = NULL; assert(pos); if (NULL == pos->pNextNode) { return; } else { DataType temp = 0; //交换pos和

void PrintListTailToHead(PSListNode pHead){ if (NULL != pHead) { //递归实现 PrintListTailToHead(pHead->pNextNode); printf("%d ", pHead->data); }}递归方式很容易就能实现。

PSListNode ByeNode(DataType data){ PSListNode pNewNode = (PSListNode)malloc(sizeof(struct SListNode)); if (NULL != pNewNode) { pNewNode->data = data; //注意使开辟的新节点的指向为空