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

class my_linked_list:
   def __init__(self):
      self.head = None
      self.last_node = None

   def add_value(self, my_data):
      if self.last_node is None:
         self.head = Node(my_data)
         self.last_node = self.head
      else:
         self.last_node.next = Node(my_data)
         self.last_node = self.last_node.next

   def reverse_display(self):
      end_node = None
      while end_node != self.head:
         curr = self.head
         while curr.next != end_node:
            curr = curr.next
         print(curr.data)
         end_node = curr

my_instance = my_linked_list()
n = int(input('您希望添加多少个元素？'))
for i in range(n):
   data = int(input('输入一个数据项：'))
   my_instance.add_value(data)
print('反向链表是：')
my_instance.reverse_display()

您希望添加多少个元素？5
输入一个数据项：43
输入一个数据项：67
输入一个数据项：87
输入一个数据项：12
输入一个数据项：34
反向链表是：
34
12
87
67
43