数据结构-栈与队列

利用栈将二进制转换为十进制

代码未运行

#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 len ,i , sum =0;

    printf("请输入二进制数，输入#表示结束/n");
    scanf("%c",&c);
    while(c!='#')
    {
        Push(&s ,c);
        scanf("%c",&c);
    }
    getchar();    //清除缓冲区

    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",sum);
    return 0;
}