思路:快慢指针,fast指针先走k步,然后快慢指针一起走
int kthToLast(struct ListNode* head, int k) { struct ListNode*slow=head; struct ListNode*fast=head; //fast指针先走k步 while(k--) { fast=fast->next; } while(fast) { slow=slow->next; fast=fast->next; } return slow->val; }
返回倒数第k个节点(力扣)
最新推荐文章于 2024-08-21 10:11:50 发布