链表倒数第n个节点

#定义链表节点
class ListNode(object):
    def __init__(self, val):
        self.val = val
        self.next = None
class Solution:
    #参数head: 链表的第一个节点。
    #参数n: 整数
    #返回值: 单链表的第n到最后一个节点。 
    def nthToLast(self, head, n):
        if head is None or n < 1:
            return None
        cur = head.next
        while cur is not None:
            cur.pre = head
            cur = cur.next
            head = head.next
        n -= 1
        while n > 0:
            head = head.pre
            n -= 1
        return head
#主函数
if __name__ == '__main__':
    solution = Solution()
    l0 = ListNode(3)
    l1 = ListNode(2)
    l2 = ListNode(1)
    l3 = ListNode(5)
    l0.next = l1
    l1.next = l2
    l2.next = l3
    ans = solution.nthToLast(l0, 2).val
    print("输入： 3->2->1->5->null,  n = 2")
    print("输出：", ans)

这里是引用