栈应用----二进制转十进制

#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);
}

void main()
{
    ElemType e;
    sqStack s;
    int len,i,sum = 0;

    InitStack(&s);

    printf("请输入2进制数，输入#表示结束：");
    scanf("%c",&e);//以字符形式输入1111001，会一个一个字符的形式输入到缓冲区，要以整形，则1111001一次以整形数存放在栈中占一个空间
    while(e != '#')
    {
        Push(&s,e);
        scanf("%c",&e);
    }
    getchar();//把'
'从缓冲区中去掉

    len = StackLen(s);

    printf("栈当前容量是：%d
",len);
    for(i = 0 ; i <len ;i++)
    {
        Pop(&s,&e);
        sum = sum + (e - 48)*pow(2,i);///***************

    }
    printf("转换为十进制数为:%d
",sum);
}