如何才能拾起脚边的砖块？ Offer 22. 链表中倒数第k个节点

题目如下

解题思路

vector存下链表，然后用小标输出

/* 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 *tail=head;
        vector<ListNode*>res;
        while(tail!=NULL){
            res.push_back(tail);
            tail=tail->next;
        }
        return res[res.size()-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) {
        if(!head || k == 0) return nullptr; // 鲁棒性1、2
        ListNode *fast = head, *slow = head;
        for(int i=1; i<=k-1; ++i){
            if(fast -> next) fast = fast -> next; // 鲁棒性3
            else return nullptr;
        }
        while(fast -> next){
            fast = fast -> next;
            slow = slow -> next;
        }
        return slow;
    }
};