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

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

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

   def print_it(self):
      curr = self.head
      while curr:
         print(curr.data)

         curr = curr.next
def reverse_list(my_list, n):
   if n == 0:
      return
   before_val = None
   curr = my_list.head
   if curr is None:
      return
   after_val = curr.next
   for i in range(n):
      curr.next = before_val
      before_val = curr
      curr = after_val
      if after_val is None:
         break
      after_val = after_val.next
   my_list.head.next = curr
   my_list.head = before_val

my_instance = LinkedList_structure()
my_list = input('输入链表的元素... ').split()
for elem in my_list:
   my_instance.add_vals(int(elem))
n = int(input('请输入您想要翻转的元素数量... '))

reverse_list(my_instance, n)

print('新的链表是: ')
my_instance.print_it()

输入链表的元素... 45 67 89 12 345
请输入您想要翻转的元素数量... 3
新的链表是:
89
67
45
12
345