c语言 实现栈结构

c语言 实现栈结构

main.c

#include "Stack.h"
#include <stdio.h>
int main(){

    Stack stack;
    initStack(&stack);
    for (ElemType i = 0; i <=10; ++i) {
            push(&stack,i);
    }
    resetStack(&stack);
    while (!isStackEmpty(&stack)){
        printf("%d ",pop(&stack));
    }

    clearStack(&stack);
    return 0;
}

Stack.h

#ifndef __STACK_H__
#define __STACK_H__
#include <stdbool.h>

//线性存储
/*

typedef char ElemType;
typedef struct _Stack{
    int _len;
    int _top;
    ElemType * _space;
}Stack;

//初始化
void initStack();
//判断是否满
bool isStackFull();
//判断是否空
bool isStackEmpty();
//压栈
void push(Stack*,ElemType);
//弹栈
ElemType pop(Stack*);
//复位栈
void resetStack(Stack*);
//清空栈
void clearStack(Stack*);

*/
//链式存储
typedef int ElemType;
typedef struct _Node{
    ElemType data;
    struct _Node* next;
}Node;

typedef struct Stack{
    Node * top;
}Stack;

//初始化
void initStack(Stack*);
//判断是否空
bool isStackEmpty(Stack*);
//压栈
void push(Stack*,ElemType);
//弹栈
ElemType pop(Stack*);
//复位栈
void resetStack(Stack*);
//清空栈
void clearStack(Stack*);
#endif

Stack.c

#include "Stack.h"
#include <stdlib.h>
#include <stdio.h>
//初始化
void initStack(Stack *s){
    s->top= malloc(sizeof(Node));
    s->top->next=NULL;
}

//判断是否空
bool isStackEmpty(Stack *s){
    return s->top->next==NULL;
}

//压栈
void push(Stack* s,ElemType data){
    Node * cur=(Node *)malloc(sizeof(Node));
    cur->data=data;
    cur->next=s->top->next;
    s->top->next=cur;
}

//出栈
ElemType pop(Stack* s) {
    Node *temp=s->top->next;
    ElemType data=temp->data;
    printf("弹出:%d",data);
    s->top->next=s->top->next->next;
    free(temp);
    return data;

}

//复位栈
void resetStack(Stack* s){
    while (!isStackEmpty(s)){
        pop(s);
    }
}

//清空栈
void clearStack(Stack* s){
    resetStack(s);
    free(s->top);
}```