题目描述
- 输入一个链表,输出该链表中倒数第k个结点。
代码(Python)
# class ListNode:
# def __init__(self, x): # 定义链表的结构
# self.val = x
# self.next = None
class Solution:
def FindKthToTail(self, head, k):
# write code here
# k 如果比我们的链表的长度大的话,直接返回Node
# k 如果小于链表的长度的话,我们可以定义两个变量,这两个变量中间间隔 k
firstPoint = head # firstPoint指针指向头节点
secondPoint = head # secondPoint指针指向头节点
for i in range(k): # 让firstPoint指针向前移动k个
if firstPoint == None: # 若firstPoint指针指向None,则返回None
return None
firstPoint = firstPoint.next
# 上面完成后,相当于我们有了间隔距离是K的两个指针,即就是firstPoint和secondPoint的距离
# 然后,让两个指针一起走,当firstPoint指针指向None时,则secondPoint就是指向倒数第k个节点
while firstPoint != None:
firstPoint = firstPoint.next
secondPoint = secondPoint.next
return secondPoint