ListNode* getKthFromEnd(ListNode* head, int k)
{
ListNode* former = head;
ListNode* latter = head;
for (int i = 0; i < k; i++)
{
former = former->next;
}
while (former != NULL)
{
former = former->next;
latter = latter->next;
}
//cout << latter->val << endl;
return latter;
}
LeetCode 链表中倒数第k个节点
最新推荐文章于 2022-05-05 09:42:59 发布