python链表实现多项式_Python单链表的简单实现方法

本文实例讲述了Python单链表的简单实现方法,分享给大家供大家参考。具体方法如下:

通常来说,要定义一个单链表,首先定义链表元素:Element.它包含3个字段:

list:标识自己属于哪一个list

datum:改元素的value

next:下一个节点的位置

具体实现代码如下:

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程序设计有所帮助。

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值