【数据结构与算法】栈的实现C程序

/* * @Author: * @Date: 2022-03-10 10:09:53 * @LastEditTime: 2022-03-10 14:49:53 * @LastEditors: Please set LastEditors * @Description: 打开koroFileHeader查看配置 进行设置: https://github.com/OBKoro1/koro1FileHeader/wiki/%E9%85%8D%E7%BD%AE * @FilePath: \sqstack\sqstack.c */ #include "sqstack.h" /** * @description: 顺序栈的创建 * @param {int} len -用户规定的栈长 * @return {sqstack-栈顶指针} */ sqstack* stack_create(int len) { sqstack * s; if ((s =(sqstack *)malloc(sizeof(sqstack))) == NULL) { printf("malloc sqstack failed\n"); return NULL; } if ((s->data = (data_t *)malloc(len * sizeof(data_t)))==NULL) { printf("malloc data failed\n"); free(s); return NULL; } memset(s->data, 0, len*sizeof(data_t)); s->maxlen = len; s->top = -1; return s; } /** * @description: 进栈 * @param {sqstack* } s-栈顶指针 * @param {data_t} value-进栈的值 * @return {-1-函数失败，0-函数成功} */ int stack_push(sqstack *s, data_t value) { if (s == NULL) { printf("s is NULL\n"); return -1; } if (s->top == s->maxlen-1) { printf("stack is full\n"); return -1; } s->top++; s->data[s->top] = value; return 0; } /** * @description: 判断栈是否为空 * @param {sqstack*} s-栈顶指针 * @return {-1-函数失败，1-栈为空，0-栈不为空} */ int stack_empty(sqstack *s) { if (s == NULL) { printf("s is NULL\n"); return -1; } return (s->top == -1 ? 1 : 0); } /** * @description: 判断栈是否满 * @param {sqstack*} s-栈顶指针 * @return {-1-函数失败，1-栈满，0-栈没满} */ int stack_full(sqstack *s) { if (s == NULL) { printf("s is NULL\n"); return -1; } return (s->top == s->maxlen-1 ? 1 : 0); } /** * @description: 出栈 * @param {sqstack*} s-栈顶指针 * @return {栈顶的值} */ data_t stack_pop(sqstack *s) { s->top--; return (s->data[s->top+1]); } /** * @description: 得到栈顶的值 * @param {sqstack*} s-栈顶指针 * @return {栈的值} */ data_t stack_top(sqstack *s) { return (s->data[s->top]); } /** * @description: 栈清空 * @param {sqstack*} s-栈顶指针 * @return {-1-函数失败，0-函数成功} */ int stack_clear(sqstack *s) { if (s == NULL) { printf("s is NULL\n"); return -1; } s->top = -1; return 0; } /** * @description: 顺序栈删除 * @param {sqstack*} s-栈顶指针 * @return {-1-函数失败，0-函数成功} */ int stack_free(sqstack *s) { if (s == NULL) { printf("s is NULL\n"); return -1; } if (s->data != NULL) free(s->data); free(s); return 0; }