# coding:utf-8# 單鏈表的相關(guān)操作： # is_empty() 鏈表是否為空 # length() 鏈表長度 # travel() 遍歷整個(gè)鏈表 # add(item) 鏈表頭部添加元素 # append(item) 鏈表尾部添加元素 # insert(pos, item) 指定位置添加元素 # remove(item) 刪除節(jié)點(diǎn) # search(item) 查找節(jié)點(diǎn)是否存在class Node(object):"""節(jié)點(diǎn)"""def __init__(self, elem):# 數(shù)據(jù)區(qū)self.elem = elem# 指向下一個(gè)節(jié)點(diǎn)self.next = Noneclass SingleLikedList(object):"""單鏈表"""def __init__(self, node = None):# 頭節(jié)點(diǎn)self.__head = nodedef is_empty(self):"""鏈表是否為空"""return self.__head is Nonedef length(self):"""鏈表長度"""cur = self.__headcount = 0while cur != None:count += 1cur = cur.nextreturn countdef travel(self):"""遍歷整個(gè)鏈表"""cur = self.__headwhile cur != None:print(cur.elem, end=" ")cur = cur.nextprint("")def add(self, item):"""鏈表頭部添加元素，頭插法"""# 創(chuàng)建一個(gè)Nodenode = Node(item)node.next = self.__headself.__head = nodedef append(self, item):"""鏈表尾部添加元素，尾插法"""# 創(chuàng)建一個(gè)Nodenode = Node(item)# 如果鏈表為空if self.is_empty():self.__head = nodeelse:cur = self.__headwhile cur.next != None:cur = cur.nextcur.next = nodedef insert(self, pos, item):"""指定位置添加元素:param pos 從0開始"""if pos <= 0:self.add(item)elif pos > (self.length() - 1):self.append(item)else:pre = self.__headcount = 0# 1 2 3 4 5 6# pos = 3, item = 9while count < (pos - 1):count += 1pre = pre.next# 當(dāng)循環(huán)結(jié)束后，pre指向要插入位置的前一個(gè)，即pos-1的位置node = Node(item)node.next = pre.nextpre.next = nodedef remove(self, item):"""刪除節(jié)點(diǎn)"""pre = Nonecur = self.__headwhile cur != None:if cur.elem == item:# 判斷此節(jié)點(diǎn)是否為頭節(jié)點(diǎn)if cur == self.__head:self.__head = cur.nextelse:pre.next = cur.nextbreakelse:pre = curcur = cur.nextdef search(self,item):"""查找節(jié)點(diǎn)是否存在"""cur = self.__headwhile cur != None:if cur.elem == item:return Trueelse:cur = cur.nextreturn Falseif __name__ == "__main__":sll = SingleLikedList()print("initialized...")print("is_empty:", sll.is_empty())print("length:", sll.length())sll.append(1)print("is_empty:", sll.is_empty())print("length:", sll.length())sll.append(2)sll.append(3)sll.append(4)sll.append(5)sll.append(6)sll.add(7)sll.travel()print("before insert exist -5:",sll.search(-5))sll.insert(-5, -5)print("after insert exist -5:", sll.search(-5))sll.travel()

轉(zhuǎn)載于:https://www.cnblogs.com/coderwjq/p/7305325.html

總結(jié)

以上是生活随笔為你收集整理的数据结构与算法-python描述-单链表的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。