用数组实现栈 Array implementation of stacks

#include <iostream>using namespace std;#define MAXSIZE 4int A[MAXSIZE];int top = -1;void Push(int x){if(top == MAXSIZE-1)return;A[++top] = x;}void Pop(){if(-1 != top)top--;}int Top(){if(-1 != top)return A[top];}void PrintStack(){for(int i = 0; i <= top; i++)cout << A[i] <<" ";cout << endl;}