2021-02-28

分析

#include <bits/stdc++.h>

using namespace std;

class MyFile {
public:
    string name;
    long long size;
    
    MyFile(string _name, long long _size){
        name = _name;
        size = _size;
    }
    
};

class MyMenu {
public:
    string name;
    bool check;
    long long LD;
    long long RD;
    map<string,MyFile> files;
    
    MyMenu(string _name) {
        name = _name;
        check = false;
    }
    
    bool contains(string name) {
        return files.find(name) != files.end();
    }
    
};

// 创建根目录
MyMenu root = MyMenu("");


vector<string> mySplit(string dir){
    vector<string> res;
    int i = 0;
    int j;
    while (i < dir.length()){
        if (dir[i] == '/') {
            j = i+1;
            while (j < dir.length() && dir[j] != '/'){
                j++;
            }
            
            res.push_back(dir.substr(i+1, j-i-1));
            i = j;
        }
        else{
            i++;
        }
        
    }
    return res;

}
char operateC(string dir, long long size){
    vector<string> strings = mySplit(dir);
    //首先
    return 'Y';
}

char operateR(string dir, long long size){
    return 'Y';
}

char operateQ(string dir, long long LD, long long LR){
    return 'Y';
}


/*
int main() {
    
    int n;
    cin >> n;
    
    
    
    int i;
    char op;
    string dir;
    long long value0;
    long long value1;
    for (i = 0; i < n; i++){
        
        cin >> op;
        
        if (op == 'C'){
            cin >> dir;
            cin >> value0;
            cout << operateC(dir,value0) << endl;
        }
        else if (op == 'R'){
            cin >> dir;
            cin >> value0;
            cout << operateR(dir,value0) << endl;
        }
        else {
            cin >> dir;
            cin >> value0;
            cin >> value1;
            cout << operateQ(dir,value0,value1) << endl;
        }
        
    }



    
    
    return 0;
}
*/
int main() {
    map<string,string> map1;
    map1.insert(pair<string,string>("a","b"));
    
    cout << (map1.find("b") != map1.end()) << endl;
    
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值