python三大数据结构-python数据结构（整理）

#!/usr/bin/python#-*- coding: utf-8 -*-

classNode(object):def __init__(self,val,p=0):

self.data=val

self.next=pclassLinkList(object):def __init__(self):

self.head=0def __getitem__(self, key):ifself.is_empty():print "linklist is empty."

return

elif key <0 or key >self.getlength():print "the given key is error"

return

else:returnself.getitem(key)def __setitem__(self, key, value):ifself.is_empty():print "linklist is empty."

return

elif key <0 or key >self.getlength():print "the given key is error"

return

else:

self.delete(key)returnself.insert(key)definitlist(self,data):

self.head=Node(data[0])

p=self.headfor i in data[1:]:

node=Node(i)

p.next=node

p=p.nextdefgetlength(self):

p=self.head

length=0while p!=0:

length+=1p=p.nextreturnlengthdefis_empty(self):if self.getlength() ==0:returnTrueelse:returnFalsedefclear(self):

self.head=0defappend(self,item):

q=Node(item)if self.head ==0:

self.head=qelse:

p=self.headwhile p.next!=0:

p=p.next

p.next=qdefgetitem(self,index):ifself.is_empty():print "Linklist is empty."

returnj=0

p=self.headwhile p.next!=0 and j

p=p.next

j+=1

if j ==index:returnp.dataelse:print "target is not exist!"

definsert(self,index,item):if self.is_empty() or index<0 or index >self.getlength():print "Linklist is empty."

return

if index ==0:

q=Node(item,self.head)

self.head=q

p=self.head

post=self.head

j=0while p.next!=0 and j

post=p

p=p.next

j+=1

if index ==j:

q=Node(item,p)

post.next=q

q.next=pdefdelete(self,index):if self.is_empty() or index<0 or index >self.getlength():print "Linklist is empty."

return

if index ==0:

q=Node(item,self.head)

self.head=q

p=self.head

post=self.head

j=0while p.next!=0 and j

post=p

p=p.next

j+=1

if index ==j:

post.next=p.nextdefindex(self,value):ifself.is_empty():print "Linklist is empty."

returnp=self.head

i=0while p.next!=0 and not p.data ==value:

p=p.next

i+=1

if p.data ==value:returnielse:return -1l=LinkList()

l.initlist([1,2,3,4,5])print l.getitem(4)

l.append(6)print l.getitem(5)

l.insert(4,40)print l.getitem(3)print l.getitem(4)print l.getitem(5)

l.delete(5)print l.getitem(5)

l.index(5)