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

class Node:
    def __init__(self,val=0,next=None) :
        self.val=val
        self.next=next

while True:
    try:
        num = int(input())
        l = list(map(int,input().split()))
        k = int(input())
        head = Node()
        p = head
        for i in range(num):
            p.next = Node(l[i])
            p = p.next

        index = num-k
        p = head.next
        for i in range(num):
            if i==index:
                print(p.val)
                break
            else:
                p=p.next
    except:
        break