Idée: Identique à la question précédente, la question du pointeur de vitesse;
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode *left = head, *right = head;
int count = 1;
while (count < k)
{
right = right->next;
count++;
}
while (right->next)
{
left = left->next;
right = right->next;
}
return left;
}
};