用数组实现栈(C/C++)

#include<cstdio>
#define MAX_SIZE 101
//全局变量
int a[MAX_SIZE];
int top = -1;
//压栈
void Push(int n) {
    if (top == MAX_SIZE) {
        printf("error:the stack is overfiow!\n");
        return;
    }
    a[++top] = n;
}
//出栈
void Pop() {
    if (top == -1) {
        printf("error:the stack is empty!\n");
        return;
    }
    top--;
}
//返回栈顶元素
int Top() {
    return a[top];
}
//判断栈是否为空
int isEmpty() {
    if (top == -1) return 1;
    return 0;
}
void print() {
    printf("stack:");
    for (int i = 0; i <= top; ++i) { //i <= top 刚开始写，没写等于，就出现了奇奇怪怪的结果
        printf("%d ", a[i]);
    }
    printf("\n");
}

int main() {
    Push(7); print();
    Push(4); print();
    Push(8); print();
    Push(1); print();
    Pop(); print();
    Push(9); print();
}

用C++实现

#include<iostream>
using namespace std;
#define MAX_SIZE 101

class Stack
{
private:
    int a[MAX_SIZE];
    int top;
public:
    Stack()
    {
        top = -1;
    }
    void Push(int n) {
        if (top == MAX_SIZE - 1) {
            cout << "error , the stack is overflow" << endl;
            return;
        }
        a[++top] = n;
    }
    void Pop() {
        if (top == -1) {
            cout << "error,the stack is empty!" << endl;
            return;
        }
        top--;
    }
    int Top() {
        return a[top];
    }
    int isEmpty() {
        if (top == -1) return 1;
        return 0;
    }
    void print() {
        cout << "stack:";
        for (int i = 0; i <= top; ++i) {
            cout << a[i] << " ";
        }
        cout << endl;
    }
};

int main()
{
    Stack s;
    s.Push(7); s.print();
    s.Push(4); s.print();
    s.Push(8); s.print();
    s.Push(1); s.print();
    s.Pop(); s.print();
    s.Push(9); s.print();
}