在 python 中使用 numpy 实现堆栈

Question

就像在 C++ 中使用数组实现堆栈一样，我想知道是否可以在 python 中使用 numpy 堆栈来实现相同的功能？这是我的看法

from turtle import shape
import numpy as np


class stack:
    def __init__(self):
        self.stack = np.empty(shape=(1,100),like=np.empty_like)
        self.n = 100
        self.top = -1

    def push(self, element):
        if (self.top >= self.n - 1):
            print("Stack overflow")
        else:
            self.top = self.top + 1
            self.stack[self.top] = element

    def pop(self):
        if (self.top <= -1):
            print("Stack Underflow")
        else:
            print("Popped element: ", self.stack[self.top])
            self.top = self.top - 1

    def display(self):
        if (self.top >= 0):
            print("Stack elements are: ")
            i = self.top
            while i >= 0:
                print(self.stack[i], end=", ")
                i = i - 1
        else:
            print("The stack is empty")

    def gettop(self):
        if (self.top <= -1):
            print("Empty stack")
        else:
            print("Top: ", self.stack[self.top])

    def isEmpty(self):
        if (self.top == -1):
            print("Stack is Empty")
        else:
            print("Stack is not empty")


if __name__ == "__main__":
    s = stack()
    ch = 0
    val = 0
    print("1) Push in stack")
    print("2) Pop from stack")
    print("3) Get Top")
    print("4) Check if Empty")
    print("5) Display Stack")
    print("6) Exit")

    while (ch != 6):
        ch = int(input("Enter Choice: "))
        print(ch)
        if (ch == 1):
            val = input("Enter the value to be pushed: ")
            s.push(val)
        elif (ch == 2):
            s.pop()
        elif (ch == 3):
            s.gettop()
        elif (ch == 4):
            s.isEmpty()
        elif (ch == 5):
            s.display()
        elif (ch == 6):
            print("Exit")
        else:
            print("Invalid Choice")

但是我一开始就卡在栈的创建上。当我尝试将任何元素推入数组时，它会生成一个全部为 12 的堆栈。

而且我确实知道在 python 中有更简单的实现，但我很好奇这是否可能。

Answer 1

我把代码弄乱了一段时间，我找到了一种方法，这里是：

"""
Time: 15:08
Date: 16-02-2022
"""
from turtle import shape
import numpy as np


class stack:
    def __init__(self):
        self.stack = np.array([0,0,0,0,0,0,0,0,0,0])
        self.n = 10
        self.top = -1

    def push(self, element):
        if (self.top >= self.n - 1):
            print("Stack overflow")
        else:
            self.top = self.top + 1
            self.stack[self.top] = element

    def pop(self):
        if (self.top <= -1):
            print("Stack Underflow")
        else:
            print("Popped element: ", self.stack[self.top])
            self.top = self.top - 1

    def display(self):
        if (self.top >= 0):
            print("Stack elements are: ")
            i = self.top
            while i >= 0:
                print(self.stack[i], end=", ")
                i = i - 1
            print("")
        else:
            print("The stack is empty")

    def gettop(self):
        if (self.top <= -1):
            print("Empty stack")
        else:
            print("Top: ", self.stack[self.top])

    def isEmpty(self):
        if (self.top == -1):
            print("Stack is Empty")
        else:
            print("Stack is not empty")


if __name__ == "__main__":
    s = stack()
    ch = 0
    val = 0
    print("1) Push in stack")
    print("2) Pop from stack")
    print("3) Get Top")
    print("4) Check if Empty")
    print("5) Display Stack")
    print("6) Exit")

    while (ch != 6):
        ch = int(input("Enter Choice: "))
        print(ch)
        if (ch == 1):
            val = input("Enter the value to be pushed: ")
            s.push(val)
        elif (ch == 2):
            s.pop()
        elif (ch == 3):
            s.gettop()
        elif (ch == 4):
            s.isEmpty()
        elif (ch == 5):
            s.display()
        elif (ch == 6):
            print("Exit")
        else:
            print("Invalid Choice")

在 python 中使用 numpy 实现堆栈

Implementation of stack using numpy in python

python

arrays

stack

numpy