用c ++实现堆栈

#include <iostream>

#define MAX_SIZE 100

class Stack {
private:
    int top; // 栈顶指针
    int stack[MAX_SIZE]; // 存储元素的数组

public:
    Stack() {
        top = -1; // 初始化栈顶指针为-1
    }

    void push(int element) {
        if (top >= MAX_SIZE - 1) {
            std::cout << "Stack overflow!" << std::endl;
            return;
        }
        stack[++top] = element; // 将元素压入栈顶
    }

    void pop() {
        if (top < 0) {
            std::cout << "Stack underflow!" << std::endl;
            return;
        }
        --top; // 从栈顶弹出元素
    }

    int topElement() {
        if (top < 0) {
            std::cout << "Stack is empty!" << std::endl;
            return -1;
        }
        return stack[top]; // 返回栈顶元素
    }

    bool isEmpty() {
        return (top < 0); // 判断栈是否为空
    }

    bool isFull() {
        return (top >= MAX_SIZE - 1); // 判断栈是否已满
    }
};

int main() {
    Stack stack;
    stack.push(1);
    stack.push(2);
    stack.push(3);

    std::cout << "Top element: " << stack.topElement() << std::endl;

    stack.pop();
    stack.pop();

    std::cout << "Top element: " << stack.topElement() << std::endl;

    return 0;
}