顺序栈的一些操作

最新推荐文章于 2019-07-25 10:51:21 发布

lwwworkspace

最新推荐文章于 2019-07-25 10:51:21 发布

阅读量339

点赞数

分类专栏：数据结构文章标签： null struct input

本文链接：https://blog.csdn.net/lwwworkspace/article/details/5793904

版权

数据结构专栏收录该内容

23 篇文章 1 订阅

订阅专栏

SqStack.h头文件

#ifndef SQSTACK_H_H #define OK 0 #define ERROR -1 #define MAX_SIZE 100 typedef int type; typedef struct SNode { type *base; type *top; int stack_size; int stack_length; }SqStack; int init_stack(SqStack*); int destroy_stack(SqStack*); int clear_stack(SqStack*); int stack_empty(SqStack); int stack_length(SqStack); int get_top(SqStack, type*); int push(SqStack*, type); int pop(SqStack*, type*); int create_stack(SqStack*); int print_stack(SqStack*); #endif

SqStack.cpp文件

#include<stdio.h> #include<stdlib.h> #include "SqStack.h" int init_stack(SqStack *stack) { if(!(stack->base = (type*)malloc(sizeof(type) * MAX_SIZE))) return ERROR; stack->top = stack->base; stack->stack_size = MAX_SIZE; stack->stack_length = 0; return OK; } int destroy_stack(SqStack *stack) { if(stack->base == NULL) return ERROR; free(stack->base); stack->base = NULL; stack->top = NULL; stack->stack_size = 0; stack->stack_length = 0; return OK; } int clear_stack(SqStack *stack) { if(stack->base == NULL || stack->stack_length == 0) return ERROR; stack->top = stack->base; stack->stack_length = 0; return OK; } int stack_empty(SqStack stack) { if(stack.base == NULL) return ERROR; if(0 == stack.stack_length) return true; return false; } int stack_length(SqStack stack) { if(stack.base == NULL) return ERROR; return stack.stack_length; } int get_top(SqStack stack, type *e) { if(stack.base == NULL || stack.stack_length == 0) { *e = -1; return ERROR; } *e = *(--stack.top); return OK; } int push(SqStack *stack, type e) { if(stack->base == NULL) return ERROR; if((stack->top + 1) - stack->base > stack->stack_size) return ERROR; *stack->top++ = e; stack->stack_length++; return OK; } int pop(SqStack *stack, type *e) { if(stack->base == NULL || stack->stack_length == 0) return ERROR; if(stack->top - 1 < stack->base) return ERROR; *e = *(--stack->top); stack->stack_length--; return OK; } int create_stack(SqStack *stack) { if(stack->base == NULL) return ERROR; type num; printf("input num: "); scanf("%d",&num); while(num != 0) { push(stack,num); scanf("%d",&num); } return OK; } int print_stack(SqStack *stack) { if(stack->base == NULL || stack->stack_length == 0) return ERROR; type *tmp = stack->top; while((--tmp) != stack->base - 1) { printf("%d ",*tmp); } printf("/n"); return OK; }