首先看單鏈表class Chain():

def __init__(self):self.first = Noneself.length = 0def is_empty(self):"""是否為空"""return self.first == Nonedef add(self, val):"""頭部添加"""node = Node(val)temp = self.firstnode.next = tempself.first = nodeself.length += 1def append(self, val):"""尾部添加"""node = Node(val)if self.first:temp = self.firstmid = Nonewhile temp:mid = temptemp = temp.nextmid.next = nodeelse:self.first = nodeself.length += 1def __setitem__(self, item, val):"""插入元素"""node = Node(val)temp, index = self.first, 0if item == 0:node.next, self.first = self.first, nodeself.length += 1else:while temp:if index+1 == item:node.next, temp.next = temp.next, nodeself.length += 1breakindex += 1temp = temp.nextdef __len__(self):"""鏈表長度"""return self.length@propertydef len_2(self):"""鏈表長度（時間復雜度O(n)）"""if not self.first:return 0else:temp = self.firstlength = 1while temp.next:length += 1temp = temp.nextreturn lengthdef pop(self):"""刪除尾部元素（有錯誤）"""temp = self.firstmid = Nonewhile temp.next:mid, temp = temp, temp.nextif mid:mid.next = Noneself.length -= 1def __delitem__(self, item):"""刪除某一位置元素"""temp, index = self.first, 0if item == 0:if self.first:self.first = self.first.nextself.length -= 1while temp:if index + 1 == item:temp.next = temp.next.nextself.length -= 1index += 1temp = temp.nextdef bianli(self):"""遍歷鏈表"""temp = self.firstwhile temp:print(temp.value)temp = temp.nextdef reverse1(self):"""反轉鏈表""" 　　　　　　temp = self.first 　　　　　　prev = None 　　　　　　while temp: 　　　　　　　　temp_next = temp.next 　　　　　　　　temp.next = prev 　　　　　　　　prev = temp 　　　　　　　　temp = temp_next 　　　　　　self.first = prevdef reverse2(self):"""反轉鏈表"""　　　　　　chain_list = []temp = self.firstwhile temp:chain_list.append(temp.value)temp = temp.nexttemp = self.firstwhile temp:temp.val = chain_list.pop()temp = temp.nextdef __iter__(self):passdef __next__(self):pass class Node():def __init__(self, val):self.value = valself.next = None

在來看雙向鏈表

''' 遇到問題沒人解答？小編創建了一個Python學習交流QQ群：778463939 尋找有志同道合的小伙伴，互幫互助,群里還有不錯的視頻學習教程和PDF電子書！ ''' class Node():def __init__(self, val):self.value = valself.prev = Noneself.next = None class Chain():def __init__(self):self.first = Nonedef is_empty(self):"""是否為空"""return self.first == Nonedef add(self, val):"""頭部添加"""node = Node(val)self.first.prev = nodetemp = self.firstnode.next = tempself.first = nodedef append(self, val):"""尾部添加"""node = Node(val)temp = self.firstif not temp:self.first = nodeelse:while temp.next:temp = temp.nextnode.prev = temptemp.next = nodedef __delitem__(self, item):"""刪除元素"""temp, index = self.first, 0while temp:if index == item:if temp.next:temp.next.prev, temp.prev.next = temp.prev, temp.nextelse:temp.prev.next = Noneindex += 1temp = temp.nextdef travel(self):temp = self.firstwhile temp:print(temp.value)temp = temp.next

總結

以上是生活随笔為你收集整理的python实现单链表与双向链表的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。