Python實現無序列表:鏈表

標籤：快速   數組下標   實現   ==   end   else   head   []   while   

鏈表有什麼用
數組: 優點: 通過索引(數組下標)可以很快地訪問數組元素;缺點: 插入/刪除元素需要對數組進行調整, 效率低;
鏈表:優點：插入/刪除速度很快，而且不用對整個鏈表進行調整；缺點：只能進行順序訪問，不能隨機訪問（像數組一樣用下標）；
所以，鏈表在一些需要快速插入／刪除，而不太關心或者不需要隨機訪問的情況下使用
首先建立Node類

class Node:def __init__(self,initdata):self.data = initdataself.next = Nonedef getData(self):return self.datadef getNext(self):return self.nextdef setData(self,newdata):self.data = newdatadef setNext(self,newnext):self.next = newnext　　

建立操作鏈結表的類

class UnorderedList:def __init__(self):self.head = Nonedef isEmpty(self):self.head == Nonedef add(self,item):temp = Node(item)temp.setNext(self.head)self.head = tempdef size(self):current = self.headcount = 0while current != None:count = count + 1current = current.getNext()return countdef search(self,item):current = self.headfound = Falsewhile current != None and not found:if current.getData() == item:found = Trueelse:current = current.getNext()return founddef getvalue(self):current = self.headcurrarr = []while current != None:currarr.append(current.getData())current = current.getNext()return currarrdef remove(self,item):current = self.headprevious = Nonefound = Falsewhile not found:if current.getData() == item:found = Trueelse:previous = currentcurrent = current.getNext()if previous == None:self.head = current.getNext()else:previous.setNext(current.getNext())

　　

Python實現無序列表:鏈表