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

class Node():
    def __init__(self,data):
        self.data=data
        self.next=None
class LinkList():
    def __init__(self):
        self.head=None
    def isempty(self):
        return self.head==None
    def append(self,data):
        node=Node(data)
        if self.isempty():
            self.head=node
        else:
            cur=self.head
            while cur.next != None:
                cur=cur.next
            cur.next=node    
    def search(self,n,k):
        cur=self.head
        if n<=0:
            print(0)
            return False
        elif cur != None:
            for i in range(k-1):
                cur=cur.next
            print(cur.data)   
if __name__ == '__main__':
    while True:
        try:
            n=int(input())
            s=input().split()
            k=int(input())
            l=LinkList()
            for i in range(n):
                l.append(s[i])
            l.search(n,n-k+1)
        except:
            break