题目描述
输入一个链表,输出该链表中倒数第k个结点。
解法一:循环法
class Solution:
def FindKthToTail(self, head, k):
if not head or not k:
return None
left, right = head, head
for i in range(k - 1):
if not right.next:
return None
right = right.next
while right.next:
left = left.next
right = right.next
return left