leetcode 224. 基本计算器(逆波兰表达式)

题目

不能处理负数，芜湖。比如3*(-5).

class Solution {
#define ll long long
public:
    int getprio(int x){
        if(x=='('-'0') return 1;//左括号在这个算法里优先级最低
        if(x=='*'-'0'||x=='/'-'0') return 3;
        if(x=='+'-'0'||x=='-'-'0') return 2;
        return 0;
    }
    int calculate(string s) {
        int n=s.size();
        if(!n) return 0;
        //得到后缀表达式,并存储在s2中
        stack<int>s1,s2;
        for(int i=0,j;i<n;i=j){//s[i]不是数字
            if(s[i]==' ') {j=i+1;continue;}//空格
            if(!(s[i]>='0'&&s[i]<='9')){
                j=i+1;
                if(s[i]=='(') s1.push(s[i]-'0');//s[i]是左括号
                else if(s[i]==')'){//s[i]是右括号
                    while(s1.top()!='('-'0') s2.push(s1.top()),s1.pop();
                    s1.pop();
                }else{//+-*/
                    while(!s1.empty()&&getprio(s1.top())>=getprio(s[i]-'0')) s2.push(s1.top()),s1.pop();
                    s1.push(s[i]-'0');
                }
            }else{//s[i]是数字
                j=i;
                int tmp=0;
                while(j<n&&(s[j]>='0'&&s[j]<='9'||s[j]==' ')) (s[j]==' ')?(++j):(tmp=tmp*10+(ll)s[j++]-'0');//这里由于是char类型,s[j]可能会爆int
                s2.push(tmp);
            }
        }
        while(!s1.empty()) s2.push(s1.top()),s1.pop();
        while(!s2.empty()) s1.push(s2.top()),s2.pop();
        //计算后缀表达式s1,s2作为计算的辅助栈
        while(!s1.empty()){
            if(s1.top()>=0) s2.push(s1.top());
            else{
                int y=s2.top();s2.pop();
                int x=s2.top();s2.pop();
                if(s1.top()=='+'-'0') s2.push(x+y);
                if(s1.top()=='-'-'0') s2.push(x-y);
                if(s1.top()=='*'-'0') s2.push(x*y);
                if(s1.top()=='/'-'0') s2.push(x/y);
            }
            s1.pop();
        }
        return s2.top();
    }
};