学到这里是我学编程以来最欢乐的一个内容,因为每次看到有关逆波兰表达式的内容都会看到一句至理名言——“想要出名,不但要有牛逼的成就,名字还要起的朗朗上口!”。哈哈,可怜的Jan Lukasiewicz,是不是应该念做简.卢卡斯维克斯?管他妈的! 逆波兰表达式不懂的去度娘之!
上代码:
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <ctype.h>
#define MAX_STACK_SIZE 20
#define STACKINCREMENT 10
#define MAXBUFFER 10
typedef double ElemType;
typedef struct SqStack
{
ElemType * base;
ElemType * top;
int stacksize;
}SqStack;
void Init(SqStack* s)
{
s->base=(ElemType *)malloc(MAX_STACK_SIZE*sizeof(ElemType));
if(!s->base)exit(0);
s->top=s->base;
s->stacksize=MAX_STACK_SIZE;
};
void Push(SqStack * s,ElemType e)
{
if (s->top-s->base >=s->stacksize)
{
s->base=(ElemType *)realloc(s->base,(MAX_STACK_SIZE+STACKINCREMENT)*sizeof(ElemType));
if(!s->base)exit(0);
}
(s->top)++;
*(s->top)=e;
}
void Pop(SqStack * s,ElemType * e)
{
if (s->top==s->base)return;
*e=*(s->top);
(s->top)--;
}
int main(void)
{
SqStack s;
char c;
double n1,n2;
char str[MAXBUFFER];
int i=0;
Init(&s);
printf("请输入正确的逆波兰表达式,数字、符号之间用空格隔开!以#结束输入:\n");
scanf("%c",&c);
while (c!='#')
{
while (isdigit(c))
{
if(c!=' ')
{
str[i++]=c;
str[i]='\0';
scanf("%c",&c);
}
if(c==' ')
{
int temp=atof(str);
Push(&s,temp);
i=0;
break;
}
}
switch(c)
{
case '+':
Pop(&s,&n1);
Pop(&s,&n2);
Push(&s,n1+n2);
break;
case '-':
Pop(&s,&n1);
Pop(&s,&n2);
Push(&s,n2-n1);
break;
case '*':
Pop(&s,&n1);
Pop(&s,&n2);
Push(&s,n1*n2);
break;
case '/':
Pop(&s,&n1);
Pop(&s,&n2);
if (n1!=0)
{
Push(&s,n2/n1);
}
else
{
printf("分母不能为零,sb!");
system("pause");
return -1;
}
break;
}
scanf("%c",&c);
}
Pop(&s,&n1);
printf("最终的结果为:%f\n",n1);
system("pause");
return 0;
}
(1)千万别去掉,因为下面要调用atof函数,需要知道字符串的结束位置。此程序可以计算带小数点的值。非常之牛逼!!!
明天学习中缀表达式,其实就是把中缀表达式转换为逆波兰表达式,然后再运用今天的代码计算。明天见!