C语言实现栈

╰半夏微凉° 2021-07-27 02:46 447阅读 0赞

**一、代码实现**

#vim stack_c.c

#include "stdio.h"
    #include "stdlib.h"
    /*栈元素结构体（用来描述每个栈元素）*/
    struct List{ 
            int data;
            struct List *next;
    
    };
    /*栈结构体（栈顶元素指针，栈大小信息）*/
    struct Stack{ 
            struct List *head;
            int size;
    };
    
    /*栈初始化*/
    struct Stack * StackInit(void)
    { 
    struct Stack  *stack=NULL;
    stack=(struct Stack *)malloc(sizeof(struct Stack)); //为栈分配一个内存块
    stack->head=(struct List *)malloc(sizeof(struct List));//分配一个栈元素内存块
    stack->head->next=NULL;
    stack->size=0;
    return stack;
    }
    /*入栈函数*/
    int StackPush(struct Stack *stack,int data)
    { 
    struct List *tmp=(struct List *)malloc(sizeof(struct List)); //分配一个栈元素内存块
    tmp->data=data;
    tmp->next=stack->head->next;
    stack->head->next=tmp;
    stack->size++;
    printf("push:%d\n",data);
    return 0;
    }
    /*判断栈是否为空*/
    int IsStackEmpty(struct Stack *stack)
    { 
    if(stack->head->next==NULL)
            return 1;
    else
            return 0;
    }
    /*出栈函数*/
    int StackPop(struct Stack *stack,int *data)
    { 
    if(IsStackEmpty(stack))return -1;
    struct List *tmp=NULL;
    tmp=stack->head->next;
    data=tmp->data;
    stack->head->next=tmp->next;
    stack->size--;
    free(tmp); //释放该栈元素内存块
    printf("pop:%d \n",data);
    
    return 0;
    }
    
    
    /*主程序，测试栈能否正常工作*/
    int main(void){ 
    int data;
    struct Stack *stack=StackInit(); //初始化一个載
    printf("Stack,start run !\n");
    StackPush(stack,1);
    StackPush(stack,88);
    printf("Current Stack Size:%d \n",stack->size);
    StackPop(stack,&data);
    StackPop(stack,&data);
    printf("Current Stack Size:%d \n",stack->size);
    
    printf("Stack,finish！\n");
    return 0;
    }

**二、编译运行**

#gcc stack_c.c -o out.bin
    #./out.bin

![在这里插入图片描述][20191104125120344.png]

[20191104125120344.png]: /images/20210726/8796b5839c7d47e9a5022a1c73fead35.png