#include<iostream>
#define MAX_SIZE 101
using namespace std;
int A[MAX_SIZE];
int top = -1;
void Push(int x)
{
if(top == MAX_SIZE - 1)
{
printf("Error: stack overflow\n");
return;
}
top++;
A[top] = x;//A[++top] = x
}
void Pop()
{
if(top == -1)
{
printf("Error: No element to pop\n");
return;
}
top--;
}
int Top()
{
return A[top];
}
void Print()
{
printf("Stack: ");
for(int i = 0; i <= top; i++)
printf("%d ", A[i]);
printf("\n");
}
int main()
{
Push(2);
Print();
Push(5);
Print();
Push(10);
Print();
Pop();
Print();
Push(12);
Print();
return 0;
}
栈:利用数组实现一个栈
最新推荐文章于 2024-07-24 17:46:08 发布