本文實(shí)例講述了Python單鏈表的簡(jiǎn)單實(shí)現(xiàn)方法，分享給大家供大家參考。具體方法如下：
通常來說，要定義一個(gè)單鏈表,首先定義鏈表元素:Element.它包含3個(gè)字段:
list:標(biāo)識(shí)自己屬于哪一個(gè)list
datum:改元素的value
next:下一個(gè)節(jié)點(diǎn)的位置
具體實(shí)現(xiàn)代碼如下：
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
希望本文所述對(duì)大家的Python程序設(shè)計(jì)有所幫助。
更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主
微信掃碼或搜索：z360901061
微信掃一掃加我為好友
QQ號(hào)聯(lián)系： 360901061
您的支持是博主寫作最大的動(dòng)力，如果您喜歡我的文章，感覺我的文章對(duì)您有幫助，請(qǐng)用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧，狠狠點(diǎn)擊下面給點(diǎn)支持吧，站長非常感激您！手機(jī)微信長按不能支付解決辦法：請(qǐng)將微信支付二維碼保存到相冊(cè)，切換到微信，然后點(diǎn)擊微信右上角掃一掃功能，選擇支付二維碼完成支付。
【本文對(duì)您有幫助就好】元
