python self next_python单链表实现代码实例

#!/usr/bin/python

# -*- coding: utf-8 -*-

class Node(object):

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

self.data = val

self.next = p

class LinkList(object):

def __init__(self):

self.head = 0

def __getitem__(self, key):

if self.is_empty():

print 'linklist is empty.'

return

elif key self.getlength():

print 'the given key is error'

return

else:

return self.getitem(key)

def __setitem__(self, key, value):

if self.is_empty():

print 'linklist is empty.'

return

elif key self.getlength():

print 'the given key is error'

return

else:

self.delete(key)

return self.insert(key)

def initlist(self,data):

self.head = Node(data[0])

p = self.head

for i in data[1:]:

node = Node(i)

p.next = node

p = p.next

def getlength(self):

p =  self.head

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):

self.head = 0

def append(self,item):

q = Node(item)

if self.head ==0:

self.head = q

else:

p = self.head

while p.next!=0:

p = p.next

p.next = q

def getitem(self,index):

if self.is_empty():

print 'Linklist is empty.'

return

j = 0

p = self.head

while p.next!=0 and j

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值