#include<stdio.h>
#include<stdlib.h>
#include<string.h>/*求算符优先级*/
int priority(char op)
{
switch(op)
{
case '#': return 1;
case ')': return 2;
case '+':
case '-': return 3;
case '*':
case '/': return 4;
case '(': return 5;
default: return 0;
}
}/*判断字符是否位操作数*/
int IsNum(char c)
{
if(c>='0'&&c<='9'||c=='.')
return 1;
else
return 0;
}typedef struct{ //存数字的栈
double data[100];
int top;
}NumStack,*PNumStack;PNumStack Init_NumStack()
{
PNumStack p;
p=(PNumStack)malloc(sizeof(NumStack));
if(p)
p->top=-1;
return p;
}double Push_NumStack(PNumStack p,double sum)
{
if(p->top==999)
return 0;
else
{
p->top++;
p->data[p->top]=sum;
return 1;
}
}int Empty_NumStack(PNumStack p)
{
if(p->top==-1)
return 1;
else
return 0;
}double Pop_NumStack(PNumStack p,double *sum)
{
if(Empty_NumStack(p))
return 0;
else
{
*sum=p->data[p->top];
p->top--;
return 1;
}
}double GetTop_NumStack(PNumStack p,double *sum)
{
if(Empty_NumStack(p))
return 0;
else
*sum=p->data[p->top];
return 1;
}void Destroy_NumStack(PNumStack *p)
{
if(*p)
free(*p);
*p=NULL;
return;
}typedef struct{ //存字符的栈
char data[100];
int top;
}CharStack,*PCharStack;PCharStack Init_CharStack()
{
PCharStack p;
p=(PCharStack)malloc(sizeof(CharStack));
if(p)
p->top=-1;
return p;
}void Push_CharStack(PCharStack p,char ch)
{
p->top++;
p->data[p->top]=ch;
}int Empty_CharStack(PCharStack p)
{
if(p->top==-1)
return 1;
else
return 0;
}int GetTop_CharStack(PCharStack p,char *ch)
{
if(Empty_CharStack(p))
return 0;
else
*ch=p->data[p->top];
return 1;
}int Pop_CharStack(PCharStack p,char *ch)
{
if(Empty_CharStack(p))
return 0;
else
{
*ch=p->data[p->top];
p->top--;
return 1;
}
}void Destroy_CharStack(PCharStack *p)
{
if(*p)
free(*p);
*p=NULL;
return;
}double Jisuan(double x,double y,char ch)/*计算结果*/
{
if(ch=='+') return double(1.0*(x+y));
else if(ch=='-') return double(1.0*(y-x));
else if(ch=='*') return double(1.0*x*y);
else if(ch=='/') return double(1.0*y/x);
}double Compute(char *str)
{
int i=0,key;
char ch,temp;
double sum,x,y,end,extrasum,index;
PNumStack num;
PCharStack cha;
num=Init_NumStack();
cha=Init_CharStack();
Push_CharStack(cha,'#');
while((GetTop_CharStack(cha,&ch),ch)!='#'||str[i]!='#')
{
if(IsNum(str[i]))//是数字
{
key=0;extrasum=0.0;index=0.1;
sum=double(str[i]-'0');
while(IsNum(str[i+1]))
{
if(str[i+1]=='.')
{
key=1;
i++;
continue;
}
if(key==0)
sum=1.0*(sum*10+str[i+1]-'0');
else
{
extrasum+=1.0*(str[i+1]-'0')*index;
index=index*0.1;
}
i++;
}
Push_NumStack(num,sum+extrasum);
i++;
}
else//是字符
{
if((GetTop_CharStack(cha,&ch),ch)=='('&&str[i]==')')
{
Pop_CharStack(cha,&temp);
i++;
}
else if((GetTop_CharStack(cha,&ch),ch)=='('||priority(str[i])>priority((GetTop_CharStack(cha,&ch),ch)))
{
Push_CharStack(cha,str[i]);
i++;
}
else
{
Pop_NumStack(num,&x);
Pop_NumStack(num,&y);
Pop_CharStack(cha,&ch);
end=Jisuan(x,y,ch);//要写函数
Push_NumStack(num,end);
}
}
}
GetTop_NumStack(num,&sum);
Destroy_NumStack(&num);
Destroy_CharStack(&cha);
return sum;
}int main()
{
char str[1000];
int lens;
double sum;
while(scanf("%s",str)!=EOF)
{
lens=strlen(str);
str[lens]='#';
str[lens+1]='\0';
//printf("%s",str);
sum=Compute(str);
printf("sum=%.4lf\n",sum);
}
return 0;
}
直接计算中缀表达式
最新推荐文章于 2023-10-08 22:31:51 发布