数组实现堆栈-压栈和弹栈

//stackarray.c

#include <stdio.h>

#define MaxSize 10

int Stack[MaxSize];
int top=-1;

void push(int value)
{
int i;
if(top>=0)
{
printf("\nThe data of the stack(before the push stack) is :\n");
for(i=top;i>=0;--i)
{
printf("[%d]",Stack[i]);
}
printf("\n");
}
++top;
if(top>=MaxSize)
{
printf("The stack is full.\n");
}
else
{
Stack[top]=value;
printf("\nThe data of the stack(after the push stack) is :\n");
for(i=top;i>=0;--i)
{
printf("[%d]",Stack[i]);
}
printf("\n");
}
}

void pop()
{
int i;
if(top<0)
{
printf("\nThe stack is empty!\n");
}
else
{
printf("\nThe data of the stack (before the pop stack) is :\n");
for(i=top;i>=0;--i)
{
printf("[%d]",Stack[i]);
}
printf("\n");
--top;
printf("The pop data is %d\n",Stack[top]);
if(top>=0)
{
printf("\nThe data of the stack (after the pop stack) is :\n");
for(i=top;i>=0;--i)
{
printf("[%d]",Stack[i]);
}
printf("\n");
}
}
}

int main()
{
int value;
int select;

do
{
printf("Please select the number(1/2/3):\n");
printf("(1)push a number to the stack\n");
printf("(2)pop a number from the stack\n");
printf("(3)exit\n");
scanf_s("%d",&select);
switch(select)
{
case 1:
printf("Please input the number you want to push the stack:\n");
scanf_s("%d",&value);
push(value);
break;
case 2:
printf("Pop a number from the stack\n");
pop();
break;
}
}while(select!=3);
return 0;
}