力扣题解 面试题22. 链表中倒数第k个节点 双100%

/**
 * 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 pre=0,last=0;
        ListNode* tmp=new ListNode();
        tmp=head;
        while(pre!=k){
            tmp=tmp->next;
            pre++;
        }
        while(tmp!=NULL){
            tmp=tmp->next;
            head=head->next;
        }
        return head;
    }
};