用栈把二进制转化为10进制

利用栈后进先出的性质写一个小程序，把二进制转化为10进制
例如二进制10001先进栈，然后再转化为10进制
代码：

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define STACK_INIT_SIZE 20
#define STACK 10
typedef char ElemType;
typedef struct
{
	ElemType *base;  //栈底
	ElemType *top;   //栈顶
	int stackSize;   //当前最大容量
}sqStack;
void InitStack(sqStack *s)     //创建栈

{
	s->base=(ElemType *)malloc(STACK_INIT_SIZE*sizeof(ElemType));
	if(s->base==0){
		exit(0);
	}
	s->top=s->base;
	s->stackSize=STACK_INIT_SIZE;
}
void push(sqStack *s,ElemType e)     //进栈
{
	*(s->top) = e;
	s->top++;
	if(s->top-s->base>=s->stackSize)
	{
		s->base=(ElemType *)realloc(s->base,(s->stackSize+STACK)*sizeof(ElemType)); //扩容
		if(s->base==0){
			exit(0);
		}
		s->stackSize=s->stackSize+STACK;
	}
}
void Pop(sqStack *s, ElemType *e){     //出栈
	if(s->top==s->base)
	{
		return;
	}
	*e=*--(s->top);
}
int StackLen(sqStack s)
{
	return(s.top-s.base);
}

int main(){
	
	ElemType c;
	sqStack s;
	int len,i,sum=0;
	
	InitStack(&s);
	printf("请输入二进制数，#表示结束！\n");
	scanf("%c",&c);              //注意要是字符型 如果是整型就把整个当做一个整数输入了
	while(c!='#')
	{
		push(&s,c);
		scanf("%c",&c);
	}
	getchar();                   //把'\n'从缓冲区去掉
	len=StackLen(s);
	printf("栈的当前容量是%d\n",len);
	for(i=0;i<len;i++){
		Pop(&s,&c);
		sum=sum+(c-'0')*pow(2,i);
	}
	printf("转化10进制的数为%d：",sum);
	return 0;
}