您的位置:首页 > 编程语言 > Python开发

【python中单链表的实现】——包括初始化、创建、逆序、遍历等

2018-01-09 11:19 726 查看
# coding=utf-8

class mynode(object):
def __init__(self, data, nextnode = None):
self.data = data
self.next = nextnode

class myLink(object):
def __init__(self, datanode):
node = mynode(datanode, None)
self.header = node
self.prev = None

def createLink(self, datalist):
tempheader = self.header
for i in range(0, len(datalist)):
node = mynode(datalist[i])
tempheader.next = node
tempheader = tempheader.next

def printLink(self):
tempheader = self.header
while tempheader != None:
print tempheader.data
tempheader = tempheader.next

def reversLink(self):
reverseheader = None
tempheader = self.header
tempnext = tempheader.next
while tempheader != None:
tempheader.next = reverseheader
reverseheader = tempheader
tempheader = tempnext
if tempheader != None:
tempnext = tempheader.next
#         tempheader.next = reverseheader
#         reverseheader = tempheader
self.header = reverseheader

if __name__ == "__main__":
mylink = myLink(1)
mylink.printLink()
print "------------"
mylink.createLink([2,3,4,5])
mylink.printLink()
print "------------"
mylink.reversLink()
mylink.printLink()
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: 
相关文章推荐