Python單鏈表的簡單實現(xiàn)方法
來源:易賢網(wǎng) 閱讀:1380 次 日期:2014-09-25 10:28:05
溫馨提示:易賢網(wǎng)小編為您整理了“Python單鏈表的簡單實現(xiàn)方法”,方便廣大網(wǎng)友查閱!

本文實例講述了Python單鏈表的簡單實現(xiàn)方法,分享給大家供大家參考。具體方法如下:

通常來說,要定義一個單鏈表,首先定義鏈表元素:Element.它包含3個字段:

list:標識自己屬于哪一個list

datum:改元素的value

next:下一個節(jié)點的位置

具體實現(xiàn)代碼如下:

?123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107 class LinkedList(object): class Element(object): def __init__(self,list,datum,next): self._list = list self._datum = datum self._next = next def getDatum(self): return self._datum datum = property( fget = lambda self: self.getDatum()) def getNext(self): return self._next next = property( fget = lambda self: self.getNext()) def __init__(self): self._head = None self._tail = None def getHead(self): return self._head head = property( fget = lambda self: self.getHead()) def prepend(self,item): tmp = self.Element (self,item,self._head) if self._head is None: self._tail = tmp self._head = tmp def insert(self, pos, item): i = 0 p = self._head while p != None and i < pos -1: p = p._next i += 1 if p == None or i > pos-1: return -1 tmp = self.Element(self, item, p._next) p._next = tmp return 1 def getItem(self, pos): i = 0 p = self._head while p != None and i < pos -1: p = p._next i += 1 if p == None or i > post-1: return -1 return p._datum def delete(self, pos): i = 0 p = self._head while p != None and i < pos -1: p = p._next i += 1 if p == None or i > post-1: return -1 q = p._next p._nex = q._next datum = p._datum return datum def setItem(self, pos, item): i = 0 p = self._head while p != None and i < pos -1: p = p._next i += 1 if p == None or i > post-1: return -1 p._datum = item return 1 def find(self, pos, item): i = 0 p = self._head while p != None and i < pos -1: if p._datum == item: return 1 p = p._next i += 1 return -1 def empty(self): if self._head == None: return 1 return 0 def size(self): i = 0 p = self._head while p != None and i < pos -1: p = p._next i += 1 return i def clear(self): self._head = None self._tail = None test = LinkedList() test.prepend('test0') print test.insert(1, 'test') print test.head.datum print test.head.next.datum

希望本文所述對大家的Python程序設計有所幫助。

更多信息請查看IT技術專欄

更多信息請查看腳本欄目
易賢網(wǎng)手機網(wǎng)站地址:Python單鏈表的簡單實現(xiàn)方法

2025國考·省考課程試聽報名

  • 報班類型
  • 姓名
  • 手機號
  • 驗證碼
關于我們 | 聯(lián)系我們 | 人才招聘 | 網(wǎng)站聲明 | 網(wǎng)站幫助 | 非正式的簡要咨詢 | 簡要咨詢須知 | 新媒體/短視頻平臺 | 手機站點 | 投訴建議
工業(yè)和信息化部備案號:滇ICP備2023014141號-1 云南省教育廳備案號:云教ICP備0901021 滇公網(wǎng)安備53010202001879號 人力資源服務許可證:(云)人服證字(2023)第0102001523號
聯(lián)系電話:0871-65099533/13759567129 獲取招聘考試信息及咨詢關注公眾號:hfpxwx
咨詢QQ:1093837350(9:00—18:00)版權所有:易賢網(wǎng)