题解 | #输出单向链表中倒数第k个结点#

python 定义节点类和链表类

#定义节点类
class list_node():
    def __init__(self,value,next_node=None):
        self.value = value
        self.next_node = next_node
#定义单向链表类
class link_list():
    def __init__(self,node):
        self.head = node
        self.length = 1
        self.tail = node
    def insert(self,value):
        temp = list_node(value)
        self.tail.next_node = temp
        self.tail = temp
        self.length += 1
    def print(self,k):
        result = ''
        if self.length >= k and k > 0:
            current = self.head
            for i in range(self.length-k):
                current = current.next_node
            result += str(current.value)
        elif k == 0:
            result += '0'
        print(result)
while True:
    try:
        n = int(input())
        numbers = list(map(int,input().split()))
        k = int(input())
        head = list_node(numbers[0])
        l_list = link_list(head)
        for i in range(1,n):
            l_list.insert(numbers[i])
        l_list.print(k)
    except:
        break