www_dong的博客

【代码】LeetCode练习4——删除有序数组中的重复项。

回文数

两数之和。

二叉树剪枝

bool hasCycle(ListNode *head) { auto walker = head; auto runner = head; while(runner && runner->next) { walker = walker->next; runner = runner->next->next; if(walker == runner) return.

ListNode *listReverse(ListNode *pHead){ if(pHead == NULL) return NULL; ListNode *pCurrent ,*pPre,*pNext; //一、指针的初始化阶段 pPre = pHead; pCurrent = pPre->next ; //二、反转单链表的核心代码 while(pCurrent) { pNext = pCurrent->next ; /.