Lintcode：链表倒数第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

python：

"""
Definition of ListNode
class ListNode(object):

    def __init__(self, val, next=None):
        self.val = val
        self.next = next
"""


class Solution:
    """
    @param: head: The first node of linked list.
    @param: n: An integer
    @return: Nth to last node of a singly linked list. 
    """
    def nthToLast(self, head, n):
        # write your code here
        if n == 0 or head == None:
            return None
        lenOfList = 0
        curNode = head
        while(curNode != None):
            lenOfList += 1
            curNode = curNode.next
        curNode = head
        for i in range(lenOfList-n):
            curNode = curNode.next
        return curNode

C++：

/**
 * 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
        if(n == 0 || head == NULL)
        {
            return NULL;
        }
        int len = 0;
        ListNode * curNode = head;
        while(curNode != NULL)
        {
            len++;
            curNode = curNode->next;
        }
        curNode = head;
        for(int i = 0; i < (len-n); i++)
        {
            curNode = curNode->next;
        }
        return curNode;
    }
};