-
题目要求:输入一个链表,输出该链表中倒数第k个结点。
-
解题思路:双指针实现
-
def FindKthToTail(head, k): # write code here if not head: return None fast_p = head slow_p = head for _ in range(k): if fast_p: fast_p = fast_p.next else: return None while fast_p: #循环的判断条件不同 fast_p = fast_p.next slow_p = slow_p.next return slow_p
剑指offer-14 链表中倒数第K个结点
最新推荐文章于 2021-02-09 20:49:50 发布