```# 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
len1=0
temp=pHead
while pHead:
len1+=1
pHead=pHead.next
if len1<k:
return None
for _ in range(len1-k):
temp=temp.next
return temp
###### 直接求出链表长度len1,然后让节点后移len1-k个,在return就可以了