zoukankan      html  css  js  c++  java
  • 【python中单链表的实现】——包括初始化、创建、逆序、遍历等

    # 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()
                
                
  • 相关阅读:
    10-padding(内边距)
    09-盒模型
    07-css的继承性和层叠性
    Python之路【第09章】:Python模块和包的详细说明
    Python之路【第10章】:程序异常处理
    Python之路【第09章】:Python模块
    排序算法—冒泡排序算法
    算法总结
    递归函数与二分法
    练习题
  • 原文地址:https://www.cnblogs.com/keke-xiaoxiami/p/8250531.html
Copyright © 2011-2022 走看看