题目描述
输入一个链表，输出该链表中倒数第k个结点。
示例1
输入
1,{1,2,3,4,5}
返回值
{5}
解题思路：快慢指针，快的先走指定的步数，慢的再走
# -*- coding:utf-8 -*-
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
def FindKthToTail(self, head, k):
# write code here
fast,slow = head, head
while fast and k > 0:
fast = fast.next
k -= 1
if k > 0:
return None
while fast:
fast = fast.next
slow = slow.next
return slow
原文链接：金乌智能 -链表中倒数第k个结点 转载请联系：金乌智能--数据抓取、数据采集、爬虫
