利用栈实现二进制数转化成十进制数
#include "stdio.h"
#include "stdlib.h"
#include "math.h"
#define OK 1
#define ERROR 0
#define STACK_INIT_DATA 20//初始化栈的大小
#define STACKINCREMENT 10//动态扩容栈的大小
typedef char Elemtype;
typedef int Status;
typedef struct{
Elemtype *top;
Elemtype *base;
int stackSize;
}sqStack;//定义一个栈
void InitStack(sqStack *s){//初始化栈
s->base=(Elemtype*)malloc(STACK_INIT_DATA*sizeof(sqStack));//为栈底申请空间
if(!s->base)//若没有空间则关闭
exit(0);
s->top=s->base;//初始化为空栈
s->stackSize=STACK_INIT_DATA;//赋值栈的大小
}
void Push(sqStack *s,Elemtype e){ //入栈函数
if(s->top-s->base>=s->stackSize){//判断栈是否已满
s->base=(Elemtype*)realloc(s->base,(s->stackSize+STACKINCREMENT)*sizeof(sqStack));//满了则扩容栈的大小
if(!s->base)
exit(0);
s->top=s->base+s->stackSize;
s->stackSize=s->stackSize+STACKINCREMENT;
}
*(s->top)=e;
s->top++;
}
void Pop(sqStack *s,Elemtype *e){//出栈函数
if(s->top==s->base)//判断是否为空栈
return;
*e=*--(s->top);
}
int StackLen(sqStack s){//计算当前栈中已被用了的空间大小
return (s.top-s.base);
}
void main(){
sqStack s;
char c;
int i,len,sum=0;
InitStack(&s);
printf("请输入一个二进制数,输入#结束:");
scanf("%c",&c);
while(c!='#'){
Push(&s,c);
scanf("%c",&c);
}
len=StackLen(s);
getchar();
for(i=0;i<len;i++){
Pop(&s,&c);
sum+=(c-48)*pow(2,i);//因为栈中的元素为字符型,0的ASCLL码为48
}
printf("转化后的十进制为:%d\n",sum);
}