/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
1.快慢指针
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode *fast = head;
while (k--)
fast = fast->next;
ListNode *slow = head;
while (fast != nullptr) {
fast = fast->next;
slow = slow->next;
}
return slow;
}
};
剑指 Offer 22. 链表中倒数第k个节点
最新推荐文章于 2024-10-18 10:39:20 发布