用C语言实现链式栈介绍

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


typedef struct node {
    struct node* pnode;
    int data;
}node_t;

typedef struct stack {
    struct node* top;//栈顶指针
    int size;//栈中数据个数
}stack_t;

void stack_init(stack_t* stk)
{
    stk->top = NULL;
    stk->size = 0;
}

void stack_push(stack_t* stk, int data)
{
    node_t *node = malloc(sizeof(node_t));
    node->data = data;
    node->pnode = stk->top;
    stk->top = node;
    stk->size++;
}

void stack_pop(stack_t* stk, int buf[], int size)
{
    for(int i = 0; i < size; ++i) {
        if(stk->size == 0) {
            printf("栈中数据已弹净！\n");
            break;
        }
        node_t* temp = stk->top;
        buf[i] = stk->top->data;
        stk->top = stk->top->pnode;
        stk->size--;
        free(temp);
    }   
}

void stack_deinit(stack_t* stk)
{
    while(stk->size || stk->top) {
        node_t* temp = stk->top;
        stk->top = stk->top->pnode;
        stk->size--;
        free(temp);
    }   
}

void print_stack(stack_t* stk)
{   
    if(stk->size == 0) {
        printf("栈中无数据！\n");
    }   
    for(node_t* node = stk->top;
        node; node = node->pnode) {
        printf("%d ",node->data);
    }   
    printf("\n");
}


#define N 30
int main(void)
{
    stack_t stack;
    int buf[N];
    stack_init(&stack);
    printf("开始压栈！\n");
    for(int i = 0; i < N; ++i) {
        stack_push(&stack, i);
    }
    print_stack(&stack);//打印栈中数据
    //stack_deinit(&stack);
    printf("开始弹栈！\n");
    stack_pop(&stack, buf, N);//弹栈
    print_stack(&stack);
    printf("取出的数据为：");
    for(int i = 0; i < sizeof(buf) /
        sizeof(buf[0]); ++i) {
        printf("%d ", buf[i]);
    }
    printf("\n");
    return 0;
}