链表-链表倒数第n个节点-简单

描述
找到单链表倒数第n个节点，保证链表中节点的最少数量为n。
您在真实的面试中是否遇到过这个题？  是
样例

给出链表 3->2->1->5->null和n = 2，返回倒数第二个节点的值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
        if(head == NULL)
            return head;
        ListNode *cur = head;
        int size = 0;
        //找到链表的长度
        while(cur){
            cur = cur->next;
            size++;
        }
        //从前向后数 
        cur = head;
        for(int i = 0; i < size - n; i++){
            cur = cur->next;
        }
        return cur;
    }
};