剑指offer22.链表中倒数第k个结点
思路
遍历一遍链表存储链表元素个数,从前往后数 n − k n-k n−k个结点
/**
* 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) {
int n = 0;
auto p = head;
while (p) p = p->next, n ++ ;
p = head;
for (int i = 0; i < n - k; i ++ ) p = p->next ;
return p;
}
};