C语言实现链栈

今天药忘吃喽~ 2022-01-31 03:01 320阅读 0赞

不多说，直接上代码

#include <stdio.h>
    #include <stdlib.h>
    
    
    #define MAX 100
    #define OK 1
    #define ERROR -1
    #define STACK_SIZE 100 
    
    typedef int Elemtype;
    
    
    //数据库 
    Elemtype data[5]={ 1,2,3,4,5};
    
    
    Elemtype number;
    
    //链栈的节点描述 
    struct list_stack
    { 
    	Elemtype datanum;
    	struct list_stack *next;
    } ;
    
    typedef struct list_stack node;
    typedef node *link;
    
    
    //初始化栈 
    link stack=NULL;
    
    
    
    
    //进栈
    link push(link stack,Elemtype data) 
    { 
    	link newpointer;
    	
    	newpointer=(link)malloc(sizeof(node));
    	
    	if(newpointer==NULL)
    	{ 
    		printf("\n****ERROR****\n");
    		exit(ERROR);
    	}
    	else
    	{ 
    		newpointer->datanum=data;
    		newpointer->next=stack;
    		stack=newpointer;
    	}
    	
    	return stack;
    	
    	
    }
    
    
    //出栈,返回栈顶节点的指针，并把栈顶节点的值赋给全局变量number 
    link pop(link stack)
    { 
    	link pointer;
    	pointer=stack;
    	
    	if(stack==NULL)
    	{ 
    		
    		printf("\n---Empty---\n");
    	}
    	else
    	{ 
    		number=stack->datanum;
    		stack=stack->next;
    		free(pointer);
    	}
    	
    	return stack;
    	
    }
    
    
    
    //打印栈
    void printf_list_stack(link stack)
    { 
    	link pointer;
    	
    	pointer=stack;
    	
    	printf("输出该堆栈:");
    	
    	
    	if(pointer==NULL)
    	{ 
    		printf("---Empty---\n");
    	}
    	
    	
    	while(pointer!=NULL)
    	{ 
    		printf(" [%d] ",pointer->datanum);
    		pointer=pointer->next;
    	}
    	
    } 
    
    
    
    
    //销毁栈 
    void free_stack(link stack)
    { 
    	link pointer;
    	
    	while(stack!=NULL)
    	{ 
    	   pointer=stack;
    	   stack=pointer->next;
    	   free(pointer);	
    	}
    }
    
    
    int main(int argc, char *argv[])
    { 
    	
    	
    	Elemtype temp,temp1,temp2;
    	
    	
    	
    	do
    	{ 
    		
    		printf("\n***请输入你想执行的功能***\n");
    		printf("(1)进栈 （2）退栈 (3)输出该栈 （4）EXIT\n");
    		scanf("%d",&temp);
    		
    		switch(temp)
    		{ 
    			case 1:
    			{ 
    				
    				printf("\n请输入你想进栈的数据：");
    				scanf("%d",&temp1);
    			 	
    			 	stack=push(stack,temp1);
    			 	
    			}break;
    			
    			
    			case 2:
    			{ 
    				stack=pop(stack);
    				temp2=number;
    				
    				printf("退栈的数据为:（%d）\n",temp2);
    				
    				
    			}break;
    			
    			
    			case 3:
    			{ 
    				
    				printf_list_stack(stack);
    				
    				
    			}break;
    			
    		}
    		
    	}
        while(temp!=4);
    	
    	
        free_stack(stack);
    	
    	
    	printf("****感谢您的使用****"); 
        printf("\n");
    	
    	return 0;
    }