顺序栈（数组实现）

#include<stdio.h>
#define maxsize 10
typedef int ElemType;
typedef struct stack{
	ElemType data[maxsize];
	int top;
}stack;
//初始化栈 
void init_stack(stack *s){
	s->top = -1;
}
//录入数据建栈
void create_stack(stack *s){
	int n,n1,i;
	printf("请输入你想创建几个数据\n");
	scanf("%d",&n);
	for(i=0;i<n;i++){
		if(s->top == maxsize-1){
			printf("栈满无法再添加\n");
			break; 
		}else{
			printf("请输入第%d个数据\n",i+1);
			scanf("%d",&s->data[i]);
			s->top = i;
		}
	} 
}
//栈插入元素
void insert_stack(stack *s){
	int n;
	n = s->top;
	if(s->top == maxsize-1){
		printf("栈满无法插入\n"); 
	}else{
		printf("请输入你要插入的元素\n");
		scanf("%d",&s->data[n+1]);
		s->top++; 
	} 
}
//删除栈内元素
void delete_stack(stack *s){
	int n;
	n = s->top;
	if(s->top == -1){
		printf("栈空无法删除\n"); 
	}else{
		s->top--; 
	} 
}
//取栈顶元素
void get_top_stack(stack *s){
	int n,n1;
	n = s->top;
	if(s->top == -1){
		printf("该栈为空\n");
	}else{
		printf("%d\n",s->data[n]);
	}
} 
//遍历栈
void print_stack(stack *s){
	int n;
	n = s->top;
	if(n == -1){
		printf("该栈为空\n"); 
	}else{
		while(n != -1){
		printf("%d ",s->data[n]);
		n--;
		}
		printf("\n");
	}
}
//栈菜单
void mune(){
	printf("1.代表初始化栈\n");
	printf("2.代表创建栈\n");
	printf("3.代表往栈内插入元素\n");
	printf("4.代表删除栈内元素\n");
	printf("5.代表取栈顶元素\n");
	printf("6.打印栈内元素\n");
	printf("7.退出系统\n");
} 
int main(){
	stack s;
	int select,flag=1;
	while(flag){
		mune();
		printf("请输入你想进行的操作\n");
		scanf("%d",&select);
		switch(select){
			case 1:
				init_stack(&s);
				break;
			case 2:
				create_stack(&s);
				break;
			case 3:
				insert_stack(&s);
				break;
			case 4:
				delete_stack(&s);
				break;
			case 5:
				get_top_stack(&s);
				break;
			case 6:
				print_stack(&s);
				break;
			case 7:
				flag = 0;
				break;
		}
	}
	return 0;
}