//利用栈实现数制转换(10进制转换8进制)
#include
#include
#define ERROR 0
#define OK 1
#define STACK_INIT_SIZE 100 //存储空间初始分配量
#define STACKINCREMENT 10 //存储空间分配增量
typedef int SElemType;
typedef struct stack
{
SElemType *top;
SElemType *bottom;
int stacksize;
}SqStack;
int InitStack(SqStack *S)
{
//构造一个空栈
S->bottom=(SElemType*)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S->bottom) return ERROR; //存储分配失败
S->top=S->bottom;
S->stacksize=STACK_INIT_SIZE;
return OK;
} //InitStack
int Push(SqStack *S,SElemType e)
{
//插入元素e为新的栈顶元素
if(S->top-S->bottom>=S->stacksize-1)
{
S->bottom=(SElemType*)realloc(S->bottom,
(S->stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!S->bottom)
return ERROR; //
S->top=S->bottom+S->stacksize;
}
*S->top++=e;
return OK;
} //Push
int Pop(SqStack *S,SElemType *e)
{
//若栈不空，则删除S的栈顶元素，用e返回其值，并返回OK;否则返回ERROR;
if(S->top==S->bottom)
return ERROR;
*e=*--S->top;
return OK;
} //Pop
int StackEmpty(SqStack S)
{
if(S.top==S.bottom)
return 1;
else return 0;
}
void main()
{
SqStack myStack;
int N,e;
InitStack(&myStack);
printf("请输入N：");
scanf("%d",&N);
while(N)
{
Push(&myStack,N%8);
N=N/8;
}
while(!StackEmpty(myStack))
{
Pop(&myStack,&e);
printf("%d",e);
}
printf("\n");
}
