利用栈来实现二进制转十进制数

栈

• 创建栈
• 压栈
• 出栈
• 销毁栈

应用介绍

1. 先利用栈将二进制数从左至右存储
2. 再利用出栈将二进制数从右至作依次弹出
3. 返回计算得到的十进制数

代码

#include <iostream>

using namespace std;

typedef int  ElemType;
#define STACK_INIT_SIZE 100
#define STACKINCREMENT  50

typedef struct
{
    ElemType* base;
    ElemType* top;
    int stackSize;
}Stack;

//创建栈
void initStack(Stack* 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 pushStack(Stack *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 = s->base + s->stackSize;             //设置栈顶
        s->stackSize = s->stackSize + STACKINCREMENT;
    }
   
    //先压栈再自加
    *(s->top) = e;
    s->top++;
}


//出栈
void popStack(Stack* s,ElemType *e)
{
    if (s->top == s->base)
    {
        return;
    }
    
    //先自减再出栈
    *e = *--(s->top);
}

//销毁栈
void destoryStack(Stack* s)
{
    int i;
    for (i = 0; i < s->stackSize; i++)
    {
        free(s -> base);
        s->base++;
    }

    s->base = s->top = nullptr;
    s->stackSize = 0;
}

//二进制数转换为十进制数
int change(Stack s)
{
    int i = 0;
    int sum = 0;
    ElemType elem;
    while (s.top != s.base)
    {
        popStack(&s, &elem);
        sum += elem * pow(2, i);
        i++;
    }

    return sum;

}


int main()
{
    Stack s;
    ElemType num;
    while(true)
    {
        initStack(&s);
        cout << "二进制数输入，请输入0或1（非0非1 则结束输入）：";
        while (true)
        {
            cout << "num = ";
            cin >> num;

            if (num == 1 || num == 0)
            {
                pushStack(&s, num);
            }
            else
            {
                break;
            }
        }

        int sum = change(s);
        cout << "十进制数为：" << sum << endl;
        
        //加上内存销毁会出现不可知的错误，估计是指针操作的问题，少用指针，太可怕
        //destoryStack(&s);

        system("pause");
        system("cls");
    }

    return 0;
}

结果

参考

小甲鱼