题解 | #链表中倒数最后k个结点#

# class ListNode:
#     def __init__(self, x):
#         self.val = x
#         self.next = None
#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param pHead ListNode类 
# @param k int整型 
# @return ListNode类
#
class Solution:
    def FindKthToTail(self , pHead , k ):
        # write code here
        if k==0: return None
        node=pHead
        res=[]
        while node:
            if len(res)<k:
                res.append(node.val)
            else:
                res.pop(0)
                res.append(node.val)
            node=node.next
        root=ListNode(None)
        if len(res)<k:
            return None
        else:
            head=root
            for i in res:
                root.next=ListNode(i)
                root=root.next
        return head.next