/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int kthToLast(ListNode* head, int k) {
ListNode *fast = head;
ListNode *slow = head;
while(k){
fast = fast->next;
k--;
}
while(fast){
slow = slow->next;
fast = fast->next;
}
return slow->val;
}
};
2022-3-27 Leetcode 面试题02.返回倒数第k个节点
最新推荐文章于 2024-04-28 19:51:12 发布