顺序栈（C++）

#include <iostream> struct stack { int* arr; int size; int top; }stack; void init() { std::cout << "栈长度："; std::cin >> stack.size; stack.arr = new int[stack.size]; stack.top = -1; } void push(int value) { if (stack.top == stack.size - 1) { std::cout << "栈满！" << std::endl; } else { stack.top++; stack.arr[stack.top] = value; std::cout << value << " 入栈" << std::endl; } } void pop() { if (stack.top == -1) { std::cout << "栈空！" << std::endl; } else { std::cout << stack.arr[stack.top] << " 出栈" << std::endl; stack.top--; } } void show() { if (stack.top == -1) { std::cout << "栈空！" << std::endl; } else { std::cout << "当前栈中：" << std::endl; for (int i = stack.top; i >= 0; i--) { std::cout << stack.arr[i] << " "; } } } int main() { init(); push(1); push(2); push(3); push(4); std::cout << std::endl; pop(); show(); return 0; }