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

import sys

class ListNode:
    def __init__(self, k):
        self.m_nKey = k
        self.m_pNext = None
    
    def add(self, node):
        n = self
        while n.m_pNext != None:
            n = n.m_pNext
        n.m_pNext = node

try:
    while True:
        N = int(input())
        p = ListNode(-1)

        list_ = input().split()
        for i in range(N):
            p.add(ListNode(int(list_[i])))
        k = int(input())
        del N

        p_last = p
        for _ in range(k):
            p_last = p_last.m_pNext
        p_answer = p
        while p_last != None:
            p_last = p_last.m_pNext
            p_answer = p_answer.m_pNext

        print(p_answer.m_nKey)
except:
    print()