标签:bsp ret 一个 self 输入 知识点 off def kth
剑指offer
输入一个链表,输出该链表中的倒数第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 pre = post = head for i in range(k): if pre == None: return None pre = pre.next while pre != None: pre = pre.next post = post.next return post
标签:bsp ret 一个 self 输入 知识点 off def kth
原文地址:https://www.cnblogs.com/gengyufei/p/11655571.html