利用栈-进制的转换

最新推荐文章于 2023-01-09 23:31:48 发布

白球球

最新推荐文章于 2023-01-09 23:31:48 发布

阅读量144

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_42817350/article/details/84546833

版权

数据结构专栏收录该内容

3 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define MAXSIZE 100
#define EXSIZE 20

typedef char ElemType;
typedef struct
{
    ElemType *base;
    ElemType *top;
    int stackSize;
} sqStack;
void InitStack(sqStack *s)
{
    s->base=(ElemType *)malloc(sizeof(ElemType)*MAXSIZE);
    if(!s->base) exit(0);
    s->top=s->base;
    s->stackSize=MAXSIZE;
}
void Pop(sqStack *s,ElemType *e)
{
    if(s->top==s->base)
        return;
    *e=*--(s->top);

}
void Push(sqStack *s,ElemType e)
{
    if(s->top-s->base>=s->stackSize)
    {
        s->base=(ElemType *)realloc(s->base,(s->stackSize+EXSIZE)*sizeof(ElemType));
        if(!s->base) exit(0);
        s->top=s->base+s->stackSize;
        s->stackSize=s->stackSize+EXSIZE;
    }
    *(s->top)=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 != '\n' )
    {
        Push(&s, c);
        scanf("%c", &c);
    }

    

    len = StackLen(s);
   

    for( i=0; i < len; i++ )
    {
        Pop(&s, &c);
        sum = sum + (c-48) * pow(2, i);
    }

    printf("十进制数是: %d\n", sum);

    return 0;
}