class Solution:
def FindKthToTail(self , pHead , k ):
fast=pHead
slow=pHead
for i in range(k):
if not fast: #如果链表长度小于k返回None
return None
fast=fast.next #快指针先走k步
while fast: #快慢指针同步走
fast=fast.next
slow=slow.next
return slow
#当快指针走出链表为空时,慢指针指向的就是倒数第k个节点
思路:快慢指针,快指针先走k步链表中倒数最后k个节点链接class Solution: def FindKthToTail(self , pHead , k ): fast=pHead slow=pHead for i in range(k): if not fast: #如果链表长度小于k返回None return None fast=fast.next