栈实现二进制转十进制

#include <stdio.h>
#include <stdlib.h>
#include <math.h>

#define STACK_INIT_SIZE 20
#define STACKINCREMENT  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 ){
        exit(0);
    }
    s->top = s->base;
    s->StackSize = STACK_INIT_SIZE;
}
void push(sqStack *s,ElemType e) {
    if( s->top - s->base >= s->StackSize){
        s->base = (ElemType *)realloc(s->base,(s->StackSize+STACKINCREMENT)*sizeof(ElemType));
        if( !s->base ){
            exit(0);
        }
    }
    *(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);
}
int main()
{
    ElemType c;
    sqStack s;
    int i,len,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-48)*pow(2,i);
    }
    printf("转换为十进制数为:%d\n",sum);
    return 0;
}