lintcode 166. 链表倒数第n个节点

找到单链表倒数第n个节点，保证链表中节点的最少数量为n。

样例
Example 1:
	Input: list = 3->2->1->5->null, n = 2
	Output: 1


Example 2:
	Input: list  = 1->2->3->null, n = 3
	Output: 1

/**
 * 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 *p=head;
        int cnt=1;
        while(p!=NULL)
        { 
            cnt++;
            p=p->next;
        }
        cnt=cnt-n;
        int i=1;
        p=head;
        while(i!=cnt)
        {
            i++;
            p=p->next;
        }
        return p;
    }
};