#166 Nth to Last Node in List

题目描述：

Find the nth to last element of a singly linked list. 

The minimum number of nodes in list is n.

Have you met this question in a real interview? 

Yes

Example

Given a List  3->2->1->5->null and n = 2, return node  whose value is 1.

题目思路：

设两个pointer slow & fast，让fast先走n步，然后slow和fast一起走，当fast走到null的时候，slow的位置就是所求答案。

Mycode（AC = 61ms）：

/**
 * Definition of ListNode
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *         this->val = val;
 *         this->next = NULL;
 *     }
 * }
 */
class Solution {
public:
    /**
     * @param head: The first node of linked list.
     * @param n: An integer.
     * @return: Nth to last node of a singly linked list. 
     */
    ListNode *nthToLast(ListNode *head, int n) {
        // write your code here
        ListNode *slow = head, *fast = head;
        int k = 0;
        
        // let fast go n steps
        while (k < n) {
            fast = fast->next;
            k++;
        }
        
        while (fast) {
            slow = slow->next;
            fast = fast->next;
        }
        
        return slow;
    }
};