鏈表由一系列不必在內存中相連的結構構成，這些對象按線性順序排序。每個結構含有表元素和指向后繼元素的指針。最后一個單元的指針指向NULL。為了方便鏈表的刪除與插入操作，可以為鏈表添加一個表頭。

單鏈表 雙鏈表

?

鏈表的常用方法：

LinkedList() 創建空鏈表，不需要參數，返回值是空鏈表

is_empty() 測試鏈表是否為空，不需要參數，返回值是布爾值

append(data) 在尾部增加一個元素作為列表最后一個。參數是要追加的元素，無返回值

iter() 遍歷鏈表，無參數，打印元素。

insert(index,value) 插入一個元素，參數為插入元素的索引和值

remove(index)移除1個元素，參數為要移除的元素或索引，并修改鏈表

size() 返回鏈表的元素數，不需要參數，返回值是個整數

search(item) 查找鏈表某元素，參數為要查找的元素，返回是布爾值

python方法實現：

class Node(object):def __init__(self, data, next = None):self.data = dataself.next = nextclass Singlelinklist(object):#創建空鏈表def __init__(self):self.head = Noneself.tail = None#測試是否為空def isempty(self):return(self.head is None)#尾部增加元素def append(self, data):node = Node(data)if self.head is None:self.head = nodeself.tail = nodeelse:self.tail.next = nodeself.tail = node#刪除一個元素def remove(self, index):if self.head is None: #empty listprint('The linklist is empty!')returntemp = self.headtemp_idx = 0while temp_idx < index - 1:temp = temp.nextif temp is None:print('List length less than index!')returntemp_idx += 1if self.head is self.tail: #list only have one nodeself.head = Noneself.tail = Nonereturnif index == 0: #remove the first nodeself.head = temp.nextreturnif temp.next is None: #remove the last nodeself.tail = temptemp.next = temp.next.next#遍歷鏈表def iter(self):if not self.head:returntemp = self.headprint(temp.data)while temp.next:temp = temp.nextprint(temp.data)#插入一個元素def insert(self, index, value):if self.head is None:print('The list is empty!')returntemp = self.headtemp_idx = 0while temp_idx < index - 1:temp = temp.nexttemp_idx += 1node = Node(value)node.next = temp.nexttemp.next = nodeif node.next is None:self.tail = node#獲取元素數def size(self):if self.head is None:print('The list is empty!')returntemp = self.headcount = 0while temp is not None:count += 1temp = temp.nextreturn count#查找一個元素def search(self, item):found = Falsetemp = self.headwhile temp is not None and not found:if temp.data == item:found = Trueelse:temp = temp.nextreturn foundif __name__ == '__main__':link = Singlelinklist()link.append(3)link.append(5)link.append(6)link.insert(1, 4)link.iter()link.remove(1)print(link.size())print(link.search(3))

?

總結

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

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