快慢指针法
ListNode *nthToLast(ListNode *head, int n) {
// write your code here
ListNode* begin = head;
ListNode* last = head;
while(n--)
{
last = last->next;
if(last == NULL)
return begin;
}
while(last)
{
begin = begin->next;
last = last->next;
}
return begin;
}
每日一题——寻找倒数第k个节点
最新推荐文章于 2021-09-08 23:17:37 发布