#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define OVERFLOW -1
#define MAXSIZE 20
#define STACK_INIT_SIZE 10
#define STACKINCREMENT 2
typedef int Status;
typedef int SElemType;
struct SqStack
{
SElemType *base;
SElemType *top;
int stacksize;
};
初始化一个空栈S:
Status InitStack(SqStack &S)
{
<span style="white-space:pre"> </span>S.base=(SElemType *)malloc(STACK_INIT_SIZE * sizeof(SElemType));
if(!S.base) exit(OVERFLOW); //存储分配失败
S.top = S.base;
S.stacksize = STACK_INIT_SIZE;
return OK;
}
将元素值e压入栈S:
Status Push(SqStack &S,SElemType e)
{
if(S.top - S.base >= S.stacksize)
{//栈满,追加存储空间
S.base = (SElemType * )realloc(S.base,(S.stacksize+STACKINCREMENT) * sizeof(SElemType));
if(!S.base) exit(OVERFLOW); //存储分配失败
S.top =S.base + S.stacksize;
S.stacksize +=STACKINCREMENT;
}
*S.top++ =e;
return OK;
}
弹出S的栈顶元素,并将其值通过e传出:
Status Pop(SqStack &S,SElemType &e)
{
if(S.top == S.base) return ERROR;
e = * -- S.top;
return OK;
}
判断栈S是否为空:
Status StackEmpty(SqStack S)
{
if(S.top == S.base) return OK;
else return ERROR;
}
测试功能conversion:
void conversion(int N ){
int e;
SqStack S;
InitStack(S);
while(N) {
Push(S,N%2); //将N取模后压入栈S
N=N/2; //将N整除2
}
printf("转换所得结果为:");
while(!StackEmpty(S)){
Pop(S,e);
printf("%d",e);
}
printf("\n");
}//conversion
Main函数:
void main()
{
int N;
printf("输入任意非负十进制整数:");
scanf("%d",&N);
conversion(N);
}
程序运行结果: