# python 数据结构之单链表的实现

python实现代码：

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

class Node(object):
def __init__(self,val,p=0):
self.data = val
self.next = p

def __init__(self):

def __getitem__(self, key):

if self.is_empty():
return

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

else:
return self.getitem(key)

def __setitem__(self, key, value):

if self.is_empty():
return

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

else:
self.delete(key)
return self.insert(key)

def initlist(self,data):

for i in data[1:]:
node = Node(i)
p.next = node
p = p.next

def getlength(self):

length = 0
while p!=0:
length+=1
p = p.next

return length

def is_empty(self):

if self.getlength() ==0:
return True
else:
return False

def clear(self):

def append(self,item):

q = Node(item)
else:
while p.next!=0:
p = p.next
p.next = q

def getitem(self,index):

if self.is_empty():
return
j = 0

while p.next!=0 and j <index:
p = p.next
j+=1

if j ==index:
return p.data

else:

print 'target is not exist!'

def insert(self,index,item):

if self.is_empty() or index<0 or index >self.getlength():
return

if index ==0:

j = 0
while p.next!=0 and j<index:
post = p
p = p.next
j+=1

if index ==j:
q = Node(item,p)
post.next = q
q.next = p

def delete(self,index):

if self.is_empty() or index<0 or index >self.getlength():
return

if index ==0:

j = 0
while p.next!=0 and j<index:
post = p
p = p.next
j+=1

if index ==j:
post.next = p.next

def index(self,value):

if self.is_empty():
return

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

if p.data == value:
return i
else:
return -1

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)

5
6
4
40
5
6

posted @ 2013-11-08 10:17  yupeng  阅读(75943)  评论(3编辑  收藏  举报