class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
if (!head) return NULL;
ListNode *pFir = head, *pSec = head;
int i = 0;
for( ; i < k; i++) {
if (!pSec) break;
pSec = pSec->next;
}
if (i < k) //注!!
return NULL;
while (pSec) {
pFir = pFir->next;
pSec = pSec->next;
}
return pFir;
}
};
链表中倒数第k个节点
最新推荐文章于 2023-02-22 19:45:18 发布