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

/*節(jié)點(diǎn)的結(jié)構(gòu)*/
typedef struct node {
    struct node* pnode;
    int data;
}node_t;
/*棧的結(jié)構(gòu)*/
typedef struct stack {
    struct node* top;//棧頂指針
    int size;//棧中數(shù)據(jù)個(gè)數(shù)
}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++;
}
/*彈棧：將棧中數(shù)據(jù)彈入buf*/
void stack_pop(stack_t* stk, int buf[], int size)
{
    for(int i = 0; i < size; ++i) {
        if(stk->size == 0) {
            printf("棧中數(shù)據(jù)已彈凈！\n");
            break;
        }
        node_t* temp = stk->top;
        buf[i] = stk->top->data;
        stk->top = stk->top->pnode;
        stk->size--;
        free(temp);
    }   
}
/*刪除整個(gè)棧*/
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);
    }   
}
/*從棧頂自上而下打印棧中所有數(shù)據(jù)*/
void print_stack(stack_t* stk)
{   
    if(stk->size == 0) {
        printf("棧中無(wú)數(shù)據(jù)！\n");
    }   
    for(node_t* node = stk->top;
        node; node = node->pnode) {
        printf("%d ",node->data);
    }   
    printf("\n");
}

/*測(cè)試代碼*/
#define N 30
int main(void)
{
    stack_t stack;
    int buf[N];
    stack_init(&stack);
    printf("開(kāi)始?jí)簵＃n");
    for(int i = 0; i < N; ++i) {
        stack_push(&stack, i);
    }
    print_stack(&stack);//打印棧中數(shù)據(jù)
    //stack_deinit(&stack);
    printf("開(kāi)始彈棧！\n");
    stack_pop(&stack, buf, N);//彈棧
    print_stack(&stack);
    printf("取出的數(shù)據(jù)為：");
    for(int i = 0; i < sizeof(buf) /
        sizeof(buf[0]); ++i) {
        printf("%d ", buf[i]);
    }
    printf("\n");
    return 0;
}