LeetCode-链表中倒数第k个节点

单链表只能从前往后遍历，所以，我们可以先计算出链表长度，倒数第k个节点相当于正数第n-k+1个节点，然后我们再从头往后找，找到第n-k+1个节点就可以了。

while循环版：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* findKthToTail(ListNode* pListHead, int k) {
        ListNode* dummy = new ListNode(-1);
        dummy->next = pListHead;
        
        ListNode* p = dummy;
        int n = 0;
        while (p->next)
        {
            n ++;
            p = p->next;
        }
        
        if (k > n) return NULL;
        
        int t = n - k + 1;
        p = dummy;
        while (t --) p = p->next;
        
        return p;
    }
};

 for循环版：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* findKthToTail(ListNode* head, int k) {
        int n = 0;
        for (auto p = head; p; p = p->next) n ++;
        if (k > n) return NULL;
        auto p = head;
        for (int i = 0; i < n - k; ++ i) p = p->next;
        return p;
    }
};