python学习之链表实现有序表

Posted 2021-07-14 今夜月色很美

1.定义链表节点对象node

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

    def getData(self):
        return self.data

    def getNext(self):
        return self.next

    def setData(self, data):
        self.data = data

    def setNext(self, node):
        self.next = node

2.使用链表实现有序表

from node import Node

class OrderArray:
    def __init__(self):
        self.head = self.last = Node(None)

    def add(self, data):
        currentNode = self.head.getNext()
        previous = self.head
        while currentNode != None:
            if currentNode.getData() > data:
                newNode = Node(data)
                newNode.setNext(currentNode)
                previous.setNext(newNode)
                break
            else:
                previous = currentNode
                currentNode = currentNode.getNext()
        else:
            self.head.setNext(Node(data))

    def removeHead(self):
        firstNode = self.head.getNext()
        if firstNode == None:
            print("有序表已经空了")
            return None
        self.head.setNext(firstNode.getNext())
        return firstNode.getData()

    def size(self):
        size = 0
        currentNode = self.head.getNext()
        while currentNode != None:
            size = size + 1
            currentNode = currentNode.getNext()
        return size

3.测试

from order_array import OrderArray

orderArray = OrderArray()
orderArray.add(345)
orderArray.add(6)
orderArray.add(23)
orderArray.add(234)
orderArray.add(45)
print(orderArray.size())
print(orderArray.removeHead())
print(orderArray.removeHead())
print(orderArray.removeHead())
print(orderArray.removeHead())
print(orderArray.removeHead())
print(orderArray.removeHead())
print(orderArray.removeHead())