数制转换.txt

这是有关数据结构的例程序

definition.h
================================================
#define INIT_SIZE 100 //存储空间初始分配量
#define INCREMENT 10  //存储空间分配增量

typedef char ElemType;

typedef struct{
ElemType *top, *base; //栈顶指针和栈底指针
unsigned stacksize;   //当前已分配的存储空间，以元素为单位
}SqStack;

int InitStack(SqStack *);       //创建一个空栈
int Push(SqStack *, char);     //插入栈顶
===============================================================================

function.c
=============================================================
#include<stdio.h>
#include<malloc.h>
#include"definition.h"

int InitStack(SqStack *S) //创建一个空栈
{ S->base=(ElemType *)malloc( INIT_SIZE * sizeof(ElemType) );
if(!S->base) //空间分配失败
  return 1;
//空间分配成功
S->top=S->base;//置栈顶指针
S->stacksize=INIT_SIZE;//栈大小
return 0;
}

int Push(SqStack *S, char e) //插入栈顶
{ if( (unsigned)(S->top - S->base) >= S->stacksize){//栈满，追加存储空间
  S->base=(ElemType *)realloc(S->base, (S->stacksize+INCREMENT)*sizeof

(ElemType) );
  if(!S->base)//分配失败，返回1
   return 1;
  //分配成功
  S->top = S->base + S->stacksize;//置栈顶指针
  S->stacksize += INCREMENT;//栈大小
}

*S->top++ = e;//入栈后，S->top指向栈顶元素的下一个位置

return 0;
} ===================================================================================

main.c
=============================================================
#include<stdio.h>
#include<malloc.h>
#include"definition.h"

int main()
{ SqStack S;
unsigned short i, flag=0;
long a;

printf("请输入一个不大于2147483647，不小于-2147483648的十进制整数：\n");
scanf("%d", &a);
if(a<0){
  a = -a;
  flag = 1;
}

printf("您想转换为哪种进制的整数呢？");
scanf("%d", &i);

if( InitStack(&S) ){
  printf("创建堆栈失败。\n");
  return 1;
}
do{//数制转换
  Push( &S, (char)(a % i) );//插入栈顶
}while(a /= i);

printf("转换结果为：");//显示结果
if(flag)
  printf("-");
while( S.top != S.base )
  printf("%d", *(--S.top) );
printf("\n");

free(S.base);//释放内存

return 0;
}