《算法笔记》栈和队列

模拟计算器

#include <iostream>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
using namespace std;
struct node {
    int num;
    char op;
    bool type;//如果为true代表是数字，如果是false代表操作符
};
queue<node> Q;//队列用来存储后缀表达式
stack<node> S;//用来存储操作符
map<char, int> M;//用来比较操作符的优先级

//中缀表达式转为后缀表达式
void change(string str){
    node node1;
    for(int i = 0; i  < str.length();){
        if(str[i] >= '0' && str[i] <= '9'){
            node1.num = str[i++] - '0';
            node1.type = true;
            //注意可能大于10
            while( i < str.length() && str[i] >= '0' && str[i] <= '9' ){
                node1.num = node1.num * 10 + (str[i] - '0');
                i ++;
            }
            //将这个数放入后缀表达式队列中
            Q.push(node1);
        }
        else if(str[i] != ' '){
            char c = str[i];
            //如果是右括号就不断弹出，直到遇到左括号
            if(c == ')'){
                while(!S.empty() && S.top().op != '('){
                    Q.push(S.top());
                    S.pop();
                }
                S.pop();
            }
            else{
                //只要当前操作符优先级小于等于栈顶操作符优先级，弹出栈顶元素并压入后缀表达式队列
                while(!S.empty() && M[c] <= M[S.top().op]){
                    Q.push(S.top());
                    S.pop();
                }
                node1.op = c;
                node1.type = false;
                S.push(node1);
            }
            i ++;
        }
        else i ++;
    }
    while(!S.empty()){
        Q.push(S.top());
        S.pop();
    }
}
//计算后缀表达式
double calculate(){
    stack<int> helper;//存储数
    while(!Q.empty()){
        node temp = Q.front();
        Q.pop();
        if(temp.type){
            helper.push(temp.num);
        }
        else{
            double a1 = helper.top();
            helper.pop();
            double a2 = helper.top();
            helper.pop();
            double res = 0.0;
            if(temp.op == '+') res = a1 + a2;
            else if(temp.op == '-') res = a1 - a2;
            else if(temp.op == '*') res = a1 * a2;
            else if(temp.op == '/') res = a1 / a2;
            helper.push(res);
        }
    }
    return helper.top();
}
int main()
{
    M['+'] = M['-'] = 1;
    M['*'] = M['/'] = 2;
    M['('] = 0;
    M[')'] = 1;
    string str;
    getline(cin, str);
    change(str);
    printf("%.2f", calculate());
    system("pause");
    return 0;
}