1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
|
class Solution { public: ListNode* getKthFromEnd(ListNode* head, int k) { ListNode* runner = head, *walker = head; for(int i = 0; i < k; ++i) runner = runner->next; while(runner) { walker = walker->next; runner = runner->next; } return walker; } };
|