#include<stdio.h>
//#include<stdlib.h>
#include<malloc.h>
#define STACK_INIT_SIZE 100
#define STACKINCREAMENT 10
#define ERROR 0
#define OK 1
typedef int Elemt;
typedef struct {
int *base;
int *top;
int stacksize;
}Sqstack;
int init_null_stack(Sqstack &S)
{ //Sqstack S;
S.base=(int*)malloc(STACK_INIT_SIZE*sizeof(int));
if(!S.base) return ERROR;
S.top=S.base;
S.stacksize=STACK_INIT_SIZE;
printf("creat stack successful!!!!\n") ;
return OK;
}
//向栈中插入元素,若栈满则,在原来的基础上多分配内存
int in_stack(Sqstack &S){
if(S.top - S.base >= STACK_INIT_SIZE ) {
S.base=(int *)realloc (S.base,(STACKINCREAMENT+STACK_INIT_SIZE)*sizeof(int));
if(!S.base) return ERROR;
S.top=S.base + S.stacksize;
S.stacksize+=STACKINCREAMENT;
}
printf("input your yuan su;\n");
scanf("%d",S.top++);
printf("init successful!!!\n");
return OK;
}
//c出栈元素
void bianli_stack(Sqstack S){
do{
printf("%d.........\n",*(--S.top));
}
while(S.top != S.base);
}
//判断该栈是否为空,若为空,则返回1,返回0;
Elemt panduan_null_stack(Sqstack S){
if(S.base == S.top) return OK;
else return ERROR;
}
int main(){
Sqstack S;
int n;
printf("输入你要插入元素的个数\n");
scanf("%d",&n);
//创建以空的栈
init_null_stack(S);
//向栈中插入元素(进栈)
while(n--)
in_stack(S);
//c出栈元素(出栈)
bianli_stack(S);
return OK;
}