如何用栈的相关操作将二进制数转化为十进制数?
1 为什么可以用栈来实现?
我们输入二进制数:0101 我们的输入顺序是 “0”,“1”,“0”,“1”。二进制转化为十进制,我们采用第n位乘于(2的n次方),所以我们会先对“1”进行操作,也就是对最后输入的先操作。而栈的操作就先进后出。
具体代码如下:
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
typedef int status;
typedef char Elemtype;
#define STACK_SIZE 20
typedef struct node
{
Elemtype *top;
Elemtype *base;
status Stacksize;
}sqStack;
void INITsqStack(sqStack*S)
{
S->base = (sqStack*)malloc(STACK_SIZE*sizeof(sqStack));
if(!S->base)
{
exit(0);
}
S->top = S->base;
S->Stacksize = STACK_SIZE;
}
void pushStack(sqStack *S,Elemtype e)
{
if(S->top - S->base<S->Stacksize)
{
*(S->top) = e;
S->top++;
}
}
void popStack(sqStack *S,Elemtype *e)
{
if(S->top == S->base)
{
return ;
}
*e = *--(S->top);
}
status lenStack(sqStack *S)
{
return (S->top - S->base);
}
int main()
{
sqStack S;
Elemtype c;
status len;
status i,sum = 0;
INITsqStack(&S);
scanf("%c",&c);
while(c != '#')
{
pushStack(&S,c);
scanf("%c",&c);
}
getchar();
len = lenStack(&S);
for(i = 0;i<len;i++)
{
popStack(&S,&c);
sum+=(c-48)*pow(2,i);
}
printf("lenStack = %d\n",len);
printf("tens = %d\n",sum);
return 0;
}