main.c

堆栈的基本功能实现,数组方式实现

#include "head.h"
void main(int argc,int *argv[])
{
	int stack[MAX];
	int top = 0;
    int temp;
	int value;
    int flag = 1;
	int select;

	
	do
	{	
		menu();
		printf("请输入:");
	    scanf("%d",&select);
		printf("\n");
		switch(select)
		{
		    case 0:
				{
					flag = 0;
					break;
				}
			case 1:
				{
					printf("当前的栈顶位置top = %d\n",top);
					if(top != 0)
					{
					    top = pop(stack,top,&temp);
					
					    printf("栈输出值为：%d\n",temp);
					
					    printf("当前的栈顶位置top = %d\n",top);
					}
					else
					{
					   top = pop(stack,top,&temp);
					   printf("复位栈顶位置top = %d\n",top);
					}
					break;

				}
			case 2:
				{
					printf("当前的栈顶位置top = %d\n",top);
					printf("请输入你想压入栈中的值：");
					scanf("%d",&value);
					printf("\n");
					top = push(stack,value,top);
					printf("当前的栈顶位置top = %d\n",top);
					break;
				}
			default:
				{
					printf("请输入正确的功能选项：");
					printf("\n");
					break;
				}
		}
	}while(flag == 1);

}