代码示例_数据结构_链式栈

链式栈

 

---

 static.h

 

#pragma once

#include <stdio.h>
#include<stdlib.h>
#include<malloc.h>


typedef struct node{
    int data;
    struct node *next;
}node;


typedef struct stack{
    node *top;
    int count;
}sta;


sta* init_stack(void);
int push(sta *s,int input);
int pop(sta *s);

 

 

 

---

 

static.c

#include "stack.h"


// 初始化栈
sta* init_stack(void){
    sta *s = (sta*)malloc(sizeof(sta));
    if(s==NULL){
        perror("malloc failed!");
        exit(1);
    }

    s->top   = NULL;
    s->count = 0;
    return s;
}


// 入栈
int push(sta *s,int input){
    
    node *pnew = (node*)malloc(sizeof(node));
    if(pnew==NULL){
        perror("malloc failed!");
        exit(1);
    }

    pnew->data = input;
    pnew->next = s->top;
    s->top     = pnew;

    s->count++;

     printf("input =  %d  入栈成功\n",input);

}


// 出栈
int pop(sta *s){

    printf("output =  %d  出栈成功\n",s->top->data);
    node *pnew = s->top;
    int a = s->top->data;
    s->top = s->top->next;

    s->count--;
    free(pnew);

    return a;

}

 

 

 

---

 

main.c

#include "stack.h"

int main(void)
{
    sta *s = init_stack();

    int i = 0;
    for(i=0;i<5;i++){

        push(s,i);

    }

printf("\n------------------\n\n");

    for(i=0;i<5;i++){

        pop(s);

    }


    return 0;
}

 

 

测试：

---

 

 

 

 

success ！