思路是两个栈,一个存数,一个存符号,定义运算的优先级,乘除为2级,加减为1级
只要运算符栈顶元素的优先级大于等于当前的优先级,就算
最后记得要将所有操作符都算完
class Solution {
public:
stack<int> nums;
stack<int> op;
void eval(){
int b = nums.top(); nums.pop();
int a = nums.top(); nums.pop();
char c = op.top(); op.pop();
if(c=='+') nums.push(a+b);
else if(c=='-') nums.push(a-b);
else if(c=='*') nums.push(a*b);
else if(c=='/') nums.push(a/b);
}
int calculate(string s) {
unordered_map<char,int> priority {{'+',1},{'-',1},{'*',2},{'/',2}};
for(int i=0;i<s.size();i++){
char c = s[i];
if(c==' ') continue;
if(isdigit(c)){
int j = i, digit = 0;
while(j<s.size()&&isdigit(s[j])) digit = digit*10 + (s[j++]-'0');
nums.push(digit);
i = j-1;
}else{
while(!op.empty()&&priority[op.top()]>=priority[c]) eval();
op.push(c);
}
}
while(!op.empty()) eval();
return nums.top();
}
};