输入一个链表,输出该链表中倒数第k个结点。
思路:两个指针,一个指针先走k步,然后两个一起走、
# -*- 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
if head==None or k<=0:
return None
else:
q=p=head
for i in range(k):
if p: #检查k是否大于链表长度
p=p.next
else:
return None
while p:
p=p.next
q=q.next
return q