python双向链表实现实例代码
示意图: python双向链表实现代码: 复制代码 代码如下: #!/usr/bin/python # -*- coding: utf-8 -*- class Node(object): class LinkList(object): def __getitem__(self,key): if self.is_empty(): elif key <0 or key > self.getlength(): else:
def __setitem__(self,key,value): if self.is_empty(): elif key <0 or key > self.getlength(): else: def initlist(self,data): self.head = Node(data[0]) p = self.head for i in data[1:]: def getlength(self): p = self.head return length def is_empty(self): if self.getlength() ==0: def clear(self): self.head = 0
q = Node(item)
if self.is_empty(): while p.next!=0 and j <index: if j ==index: else: print 'target is not exist!' def insert(self,index,item): if self.is_empty() or index<0 or index >self.getlength(): if index ==0: self.head = q p = self.head if index ==j:
if self.is_empty() or index<0 or index >self.getlength(): if index ==0: self.head = q p = self.head if index ==j: def index(self,value): if self.is_empty(): p = self.head if p.data == value:
l.insert(4,40) l.delete(5) l.index(5) 结果为; 5 和单链表结果一样。 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |