机试指南第五章数据结构一

最新推荐文章于 2024-08-29 11:53:56 发布

草薙京丶

最新推荐文章于 2024-08-29 11:53:56 发布

阅读量97

点赞数

分类专栏：算法学习

本文链接：https://blog.csdn.net/weixin_42562498/article/details/104581586

版权

算法学习专栏收录该内容

20 篇文章 0 订阅

订阅专栏

P79 习题5.1

http://t.cn/AiKKM6F6
在这里插入图片描述

#include <iostream>
#include <stack>

using namespace std;

int main(){
    freopen("D://case.txt","r",stdin);
    int n;
    while(cin>>n){
        char operate;
        int temp;
        stack <int> sta;
        for (int i=0;i<n;i++){
            cin>>operate;
            if (operate == 'P'){
                cin>>temp;
                sta.push(temp);
            }
            if (operate == 'O'){
                if (!sta.empty()){
                    sta.pop();
                }
            }
            if (operate == 'A'){
                if (sta.empty()){cout<<'E'<<endl;}
                else {cout<<sta.top()<<endl;}
            }
        };
        cout<<endl;
    }
    return 0;
}

P79 习题5.2

http://t.cn/AiKKJ5
在这里插入图片描述

#include <iostream>
#include <string>
#include <stack>

using namespace std;

double getnum(int &i,string str){
    int num = 0;
    for (;i<str.size();i++){
        if (isdigit(str[i])){
            num = num*10+str[i]-'0';
        }
        else{break;}
    }
    return num;
}

int prior(char x){
    if (x == '#'){return 0;}
    if (x == '$'){return 1;}
    if (x == '+'||x == '-'){return 2;}
    if (x == '*'||x == '/'){return 3;}
}

double  calculate(double  x,double  y,char operate){
    //cout<<x<<operate<<y<<endl;
    if (operate == '+'){return x+y;}
    if (operate == '-'){return x-y;}
    if (operate == '*'){return x*y;}
    if (operate == '/'){return x/y;}
}

int main(){
    freopen("D:\\case.txt","r",stdin);
    stack <char> operate;
    stack <double> num;
    string stringcase;
    cin>>stringcase;
    operate.push('#');
    stringcase += "$";
    int i=0;
    while(i<stringcase.size()){
        if (isdigit(stringcase[i])){
            num.push(getnum(i,stringcase));
        }
        else{
            if (prior(stringcase[i])>prior(operate.top())){
                operate.push(stringcase[i++]);
            }
            else {
                double  x,y;
                y = num.top();
                num.pop();
                x = num.top();
                num.pop();
                num.push(calculate(x,y,operate.top()));
                operate.pop();
            }
        }
    }
    cout<<num.top();
    return 0;
}