3302. 表达式求值-栈的应用

3302. 表达式求值

解析

#include<iostream>
#include<cstring>
#include<algorithm>
#include<stack>
#include<unordered_map>
using namespace std;
unordered_map<char,int> h = {{'+',1},{'-',1},{'*',2},{'/',2}};
stack<int> num;
stack<char> op;
void eval()
{
    int x,y,res;
    char p;
    x = num.top();  //第二个数值
    num.pop();
    y = num.top();
    num.pop();
    p = op.top();
    op.pop();
    if(p=='+') res = y+x;
    if(p=='-') res = y-x;
    if(p=='*') res = y*x;
    if(p=='/') res = y/x;
    num.push(res);
}

int main()
{
    string s;
    cin>>s;
    for(int i=0;i<s.length();i++)
    {
        if(isdigit(s[i]))
        {
            int x = 0,j =i;
            while(j<s.length()&&isdigit(s[j]))
                x = x*10 + s[j++] - '0';
            i=j-1;  //for循环还有i++ 所以这个地方要-1
            num.push(x);
        }
        else if(s[i]=='(')
            op.push(s[i]);
        else if(s[i]==')')
        {
            while(op.top() != '(')
                eval();
            op.pop();
        }
        else 
        {
            while(op.size() && h[op.top()] >= h[s[i]])
                eval();
            op.push(s[i]);
        }
    }
    while(op.size()) 
        eval();
    cout<<num.top();
}