Python基础之堆栈基础的二次代码封装

柔光的暖阳◎ 2022-04-21 17:32 136阅读 0赞

#!/usr/bin/env python3
    # encoding : utf-8
    # @author  : 'Jonny'
    # @location: '北京'
    # @date    : '2018/11/26 15:02'
    # @Email   : 15006562764@163.com
    # @File    : StackHelp.py
    # @Software: PyCharm
    # @blog    : https://blog.csdn.net/m0_37338590
    # @describe: 顺序栈和链式栈的python实现
    
    
    # 顺序存储
    class LineStack(object):
        # 初始化一个栈
        def __init__(self, size):
            self.size = size
            self.num = 0
            self.stack = []
    
        # 获取栈的长度
        def getSize(self):
            return self.num
    
        # 输出栈
        def outStack(self):
            for l in self.stack:
                print(l)
    
        # 进栈
        def appendStack(self, value):
            if self.num >= self.size:
                print("the stack is full")
                return
            else:
                self.stack.append(value)
                self.num += 1
    
        # 出栈
        def popStack(self):
            if self.isEmpty():
                print("the stack is empty,no element can be output")
                return None
            else:
                topElement = self.stack[-1]
                self.stack.remove(topElement)
                return topElement
    
        def isEmpty(self):
            if self.num == 0:
                return True
            else:
                return False
    
        def isFull(self):
            if self.num == self.size:
                return True
            else:
                return False
    
    
    # 链式对象建立
    class Node(object):
        def __init__(self, vaule, q=0):
            self.value = vaule
            self.next = q
    
    
    # 链式存储
    class chainStack(object):
        # 初始化链栈
        def __init__(self):
            self.head = 0
    
        # 判断栈是否为空
        def isEmpty(self):
            if self.head == 0:
                return True
            else:
                return False
    
        # 计算栈的长度
        def getSize(self):
            length = 0
            p = self.head
            while p != 0:
                length += 1
                p = p.next
            return length
    
        # 将数组初始化成栈存储
        def initStack(self, list):
            self.head = Node(list[0])
            node = self.head
            for i in list[1:]:
                p = Node(i)
                p.next = node
                node = p
    
        # 进栈
        def insert(self, value):
            if self.head == 0:  # 如果为空栈，直接插入
                self.head = Node(value)
            else:
                node = Node(value)
                node.next = self.head
                self.head = node
    
        # 出栈
        def pop(self):
            if self.head == 0:  # 如果为空栈，提示栈为空
                print("the stack is empty")
                return None
            else:
                l = self.head.value
                self.head = self.head.next
                return l
    
        # 输出栈
        def outStack(self):
            if self.head == 0:  # 如果为空栈，提示栈为空
                print ("the stack is empty")
                return None
            p = self.head
            while p != 0:
                print(p.value)
                p = p.next