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 calculate_length(self):
      curr = self.head
      length_val = 0
      while curr:
         length_val = length_val + 1
         curr = curr.next
      return length_val

my_instance = my_linked_list()
my_data = input('输入单向链表的元素 ').split()
for elem in my_data:
   my_instance.add_value(int(elem))
print('单向链表的长度为 ' + str(my_instance.calculate_length()))

输入单向链表的元素 34 12 56 86 32 99 0 6
单向链表的长度为 8