BM8 链表中倒数最后k个结点

算法-目录
题目来源： BM8 链表中倒数最后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: ListNode, k: int) -> ListNode:
        # write code here
        cur,n=pHead,0
        while cur:
            n+=1
            cur=cur.next
        c=0
        while pHead:
            if c==n-k:
                return pHead
            pHead=pHead.next
            c+=1