剑指 Offer 22. 链表中倒数第k个节点

要求：rt
思路

/**
 * 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* cur=head;
        for(int i=0;i<k;++i)cur=cur->next;
        while(cur){
            cur=cur->next;
            head=head->next;
        }
        return head;
    }
};