链栈（结构体实现）

#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct Node{
	ElemType data;
	struct Node *next; 
}stack,*LinkStack;
//返回值初始化
stack * init_stack(stack *s){
	s = (stack *)malloc(sizeof(stack));
	s->next = NULL;
	return s;
}
//创建链栈 
void create_stack(stack *s){
	stack *p;
	int x=0;
	while(1)
	{
		printf("请输入你想初始化的数字，以回车分割，以-1结束\n");
		scanf("%d",&x);
		if(x == -1)
		{
			break;
		}else{
			p = (stack *)malloc(sizeof(stack));
			p->data = x;
			p->next = s->next;
			s->next = p; 
		}
	}
}
//入栈 
void insert_stack(stack *s){
	stack *p;
	p = (stack *)malloc(sizeof(stack)); 
	printf("请输入你要插入的数据\n");
	scanf("%d",&p->data);
	p->next = s->next;
	s->next = p; 
}
//出栈
void delete_stack(stack *s){
	stack *p;
	p = s;
	if(p->next == NULL){
		printf("该栈为空无法出栈\n");
	}else{
		p->next = p->next->next;
	}
}
//获取栈顶元素
void get_top_stack(stack *s){
	stack *p;
	p = s;
	if(p->next == NULL){
		printf("该栈为空无法出栈\n");
	}else{
		printf("%d\n",s->next->data);
	}
}   
//打印链表 
void print_stack(stack *s){
	stack *n;
	n = s->next;
	if(n->next == NULL){
		printf("该表为空\n"); 
	}else{
		while(n){
			printf("%d ",n->data);
			n = n->next;
		}
	}
	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:
				s = 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;
}