|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define STACK_INIT_SIZE 20
#define STACKINCREAMENT 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->base=s->top;
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+STACKINCREAMENT)*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;
InitStack(&s);
printf("请输入二进制数,以#为结束\n");
scanf("%c",&c);
while(c!='#')
{
Push(&s,c);
scanf("%c",&c);
}
getchar();//把回车键从键盘缓冲区去掉
len=StackLen(s);
printf("栈的当前容量是:%d\n",c);
for(i=0;i<len;i++)
{
Pop(&s,&c);
sum+=(c-48)*pow(2,i);//c是ASCLL码,0为48,1为49
}
printf("转化为十进制数为:%d\n",sum);
return 0;
}
|
|