lafloveyou的博客

代码如下：ListNode * ReverseList(ListNode* pHead){ ListNode *pReverseHead = NULL; ListNode* pNode = pHead; ListNode* pPrev = NULL; while (pNode != NULL) { ListNode* pNext = pNode->m_pNext; if (

本算法从下标1开始遍历 利用双指针的形式遍历， 大大提高了代码的查找速度：ListNode* FindKthToTail(ListNode* pListHead, unsigned int k){ if (pListHead == NULL || k ==0) { return NULL; } ListNode* pAhead = pListHead; ListNode* pB

笔者的时间复杂度为O(1)下面是实现的函数：void DeleteNode(ListNode** pHead, ListNode* pToBeDeleted){//删除链接节点算法 时间复杂度为O(1); if (!pHead || !pToBeDeleted) { return; } if (pToBeDeleted->m_pNext != NULL) { ListNo

题主用的是VS2013编辑器链表的创建头文件:struct ListNode{ int m_nValue; ListNode* m_pNext;};_declspec(dllexport) ListNode* CreateListNode(int value);_declspec(dllexport)void CoonnectListNode(ListNode* pCurren

代码如下ListNode* Merge(ListNode* pHead1, ListNode* pHead2){ if (pHead1 == NULL) { return pHead2; } else if (pHead2 == NULL) { return pHead1; } ListNode* pMergeHead = NULL; if (pHead1->m_nVal