#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef struct sqstack
{
int *base;
int *top;
int stacksize;
}sqstack;
int InitStack(sqstack *s )
{
s->base=(int *)malloc(STACK_INIT_SIZE*sizeof(int));
if(!s->base)return 0;
s->top=s->base;
s->stacksize=STACK_INIT_SIZE;
return 1;
}
int Push(sqstack *s ,int e)
{
if(s->top-s->base>=s->stacksize)
{
s->base=(int *)realloc(s->base,(s->stacksize+STACKINCREMENT)*sizeof(int));
if(!s->base)return 0;
s->top=s->base+s->stacksize;
s->stacksize+=STACKINCREMENT;
}
*s->top++=e;
return e;
}
int Pop(sqstack *s, int e)
{
if(s->top==s->base)return 0;
e=*--s->top;
return e;
}
int StackEmpty(sqstack *s)
{
if(s->top==s->base)return 1;
else return 0;
}
int main()
{
int n,
栈的应用——数值转换为任意进制
最新推荐文章于 2022-12-18 11:47:54 发布