提示:该blog仅为完成作业,大佬请绕路
老师的代码
//202031061018 刘知鑫
#include <iostream>
#include <cstring>
#include <algorithm>
#include <stack>
#include <unordered_map>
using namespace std;
stack<int> num;
stack<char> op;
void eval()
{
auto b = num.top();
num.pop();
auto a = num.top();
num.pop();
auto c = op.top();
op.pop();
int x;
if (c == '+') x = a + b;
else if (c == '-') x = a - b;
else if (c == '*') x = a * b;
else x = a / b;
num.push(x);
}
int main()
{
unordered_map<char, int> pr{{'+', 1}, {'-', 1}, {'*', 2}, {'/', 2}};
string str;
cin >> str;
for (int i = 0; i < str.size(); i ++ )
{
auto c = str[i];
if (isdigit(c))
{
int x = 0, j = i;
while (j < str.size() && isdigit(str[j]))
x = x * 10 + str[j ++ ] - '0';
i = j - 1;
num.push(x);
}
else if (c == '(') op.push(c);
else if (c == ')')
{
while (op.top() != '(') eval();
op.pop();
}
else
{
while (op.size() && op.top() != '(' && pr[op.top()] >= pr[c]) eval();
op.push(c);
}
}
while (op.size()) eval();
cout << num.top() << endl;
return 0;
}
我的代码
#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#define Maxsize 100
typedef int dataType;
typedef struct Stack
{
dataType *top;
dataType *base;
int stacksize;
}sqstack;
void create(sqstack *s)
{
s->base=(dataType *)malloc(Maxsize*sizeof(dataType));
if(!s->base)
{
printf("Space allocation failed!\n");
return;
}
s->top=s->base;
s->stacksize=Maxsize;
return;
}
int push_in(sqstack *s,dataType value)
{
if(s->top-s->base==s->stacksize)
{
printf("Stack is full!\n");
return;
}
*s->top=value; //"*s->top++=value;"
s->top++;
return;
}
int pop_out(sqstack *s,dataType *elem)
{
if(s->base==s->top)
{
printf("Stack is empty!");
return;
}
s->top--;
*elem=*s->top; //"*elem=*--s->top;"
return;
}
dataType GetTop(sqstack *s)
{
if(s->base==s->top)
{
printf("Stack is empty!\n");
printf("Unable to fetch top stack element!\n");
return;
}
return *(s->top-1);
}
char Precede(char theta1,char theta2)
{
int i,j;
char pre[7][7]={// + - * / ( ) =
{'>','>','<','<','<','>','>'},
{'>','>','<','<','<','>','>'},
{'>','>','>','>','<','>','>'},
{'>','>','>','>','<','>','>'},
{'<','<','<','<','<','=','0'},
{'>','>','>','>','0','>','>'},
{'<','<','<','<','<','0','='}};
switch(theta1){
case '+': i=0; break;
case '-': i=1; break;
case '*': i=2; break;
case '/': i=3; break;
case '(': i=4; break;
case ')': i=5; break;
case '=': i=6; break;
}
switch(theta2){
case '+': j=0; break;
case '-': j=1; break;
case '*': j=2; break;
case '/': j=3; break;
case '(': j=4; break;
case ')': j=5; break;
case '=': j=6; break;
}
return(pre[i][j]);
}
int Operate(int a,char theta,int b)
{
int result;
switch(theta){
case'+':return a+b;
case'-':return a-b;
case'*':return a*b;
case'/': //判断除数是否为0,若除数为零返回错误提示
if(b!=0)
return a/b;
else
{
printf("Divisor can not Be zero!\n");
exit(0);
}
}
}
int In(char c) //判断是否为运算符,是运算符返回1,若不是返回0
{
switch(c){
case '+':
case '-':
case '*':
case '/':
case '(':
case ')':
case '=':
return 1;
default:
return 0;
}
}
int evaluateExpression(char exp[])
{
sqstack OPND,OPTR; //运算数栈、运算符栈
dataType a,b,theta,x,X1,X2; /* a,b,theta用于Operate函数
X用于存放多余的出栈字符
X1,X2用于归并 */
char ch; //读取字符的变量
int i=0; //指向存放表达式数组的下标指针(其实不是真正的指针,而是数组下标)
create(&OPND); //建立并初始化运算数栈OPND
create(&OPTR); //建立并初始化运算符栈OPTR
push_in(&OPTR,'='); //先将“=”号压入OPTR栈(表达式也必须以“=”结束)
ch=exp[i++]; //ch读取字符数组第一个元素,并将指针i后移一位
while(ch!='='||GetTop(&OPTR)!='=') //表达式没有扫描完毕或OPTR的栈顶不为“=”
{
if(In(ch)) //判断ch是否为操作符
{
switch(Precede(GetTop(&OPTR),ch))//比较ch的与OPTR栈顶元素的优先级
{
case'<':
push_in(&OPTR,ch);
ch=exp[i++]; //读取下一位字符并将指针向后偏移一位
break;
case'>':
pop_out(&OPTR,&theta);
pop_out(&OPND,&b);
pop_out(&OPND,&a);
push_in(&OPND,Operate(a,theta,b));
break;
case'=':
pop_out(&OPTR,&x);
ch=exp[i++]; //读取下一位字符并将指针向后偏移一位
break;
}
}
else if(isdigit(ch)) //判断是否为数字
{
X1=ch-'0'; //将字符形式转化为数字
push_in(&OPND,X1);
X2=X1;
ch=exp[i++]; //读取下一位字符并将指针向后偏移一位
while(isdigit(ch)) //判断下一位是否还是数字
{
X1=ch-'0';
X2=10*X2+X1; //归并至X2
pop_out(&OPND,&x);
push_in(&OPND,X2);
ch=exp[i++]; //读取下一位字符并将指针向后偏移一位
}
}
else if(ch==' ') //判断是否为空格
{
while(ch==' ') //跳过若干个空格
{
ch=exp[i++]; //忽略空格,直接取下一位
}
}
else //若不是上述三种情况之一,则为非法字符
{
printf("Input has illegal characters!\n");
printf("Please enter again.\n");
exit(0); //返回错误提示
}
}
return(GetTop(&OPND)); //最后返回操作数栈顶为运算结果
}
int main()
{
char exp[100]; //定义一个字符数组用于存储表达式
int result;
printf("Please Enter Expression:");
gets(exp); //换成scanf(“%s”,exp);也可以
result=evaluateExpression(exp);
printf("\n");
printf("%s%d\n",exp,result);
return 0;
}