原题链接:https://leetcode-cn.com/problems/lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof/
双指针
class Solution {
public:
ListNode* getKthFromEnd(ListNode* head, int k) {
ListNode* p = head, *q = head;
for (int i = 0; i < k; i++) {
q = q->next;
}
while(q != NULL) {
p = p->next;
q = q->next;
}
return p;
}
};