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 is not None:
         print(curr.data)
         curr = curr.next

def add_linked_list(my_list_1, my_list_2):
   sum_list = LinkedList_structure()
   curr_1 = my_list_1.head
   curr_2 = my_list_2.head
   while (curr_1 and curr_2):
      sum_val = curr_1.data + curr_2.data
      sum_list.add_vals(sum_val)
      curr_1 = curr_1.next
      curr_2 = curr_2.next
   if curr_1 is None:
      while curr_2:
         sum_list.add_vals(curr_2.data)
         curr_2 = curr_2.next
   else:
      while curr_1:
         sum_list.add_vals(curr_1.data)
         curr_1 = curr_1.next
   return sum_list

my_list_1 = LinkedList_structure()
my_list_2 = LinkedList_structure()

my_list = input('输入第一个链表的元素：').split()
for elem in my_list:
   my_list_1.add_vals(int(elem))

my_list = input('输入第二个链表的元素：').split()
for elem in my_list:
   my_list_2.add_vals(int(elem))

sum_list = add_linked_list(my_list_1, my_list_2)

print('链表中元素的总和为：')
sum_list.print_it()

输入第一个链表的元素：56 34 78 99 54 11
输入第二个链表的元素：23 56 99 0 122 344
链表中元素的总和为：
79
90
177
99
176
355