python实现单链表

程序猿

# coding:utf-8 class Node: def __init__(self, value): self.data = value self.next = None class LinkList: def __init__(self, data=[0]): self.head = None self.init_link_list(data) # 初始化链表 # data 为数组 def init_link_list(self, data): if len(data) == 0: print("Initialization data is null") return self.head = Node(data[0]) current = self.head for index in data[1:]: current.next = Node(index) current = current.next # 获取当前结点 def get_node(self, index): if self.is_empty(): print("link is empty") return if index > self.get_length() or index <= 0: print("node is not exist") return current = self.head i = 0 while i [i] self.get_length() or index <= 1: print("node is not exist") return pre = self.head i = 0 while i