ccf-201604-3 路径解析

ccf-201604-3 路径解析

#include <iostream>
#include <string>
#include <vector>
using namespace std;
void split(const string& s,vector<string>& v, const string& c) {
    string::size_type pos1, pos2;
    pos2 = s.find(c);
    pos1 = 0;
    while(string::npos != pos2) {
        if(pos2>pos1) {
            v.push_back(s.substr(pos1, pos2-pos1));
        }
        pos1 = pos2 + c.size();
        pos2 = s.find(c, pos1);
    }
    if(pos1 != s.length()) {
        v.push_back(s.substr(pos1));
    }
}
int n;
string t;
vector<string> cur,ou,st;
int main() {
    cin>>n;
    cin>>t;
    split(t,cur,"/");
    getline(cin,t);
    for(int i=0; i<n; i++) {
        st.clear();
        ou.clear();
        getline(cin,t);
        if(t=="") {
            for(int j=0; j<cur.size(); j++) {
                ou.push_back(cur[j]);
            }
        } else {
            split(t,st,"/");
            if(st.size()==0) {
                ou.push_back("");
            }
            if(t[0]!='/') {
                for(int j=0; j<cur.size(); j++) {
                    ou.push_back(cur[j]);
                }
            }
            for(int j=0; j<st.size(); j++) {
                if(st[j]=="..") {
                    if(ou.size()>0) {
                        ou.pop_back();
                    }
                } else if(st[j]==".") {
                } else {
                    ou.push_back(st[j]);
                }
            }
        }
        for(int j=0; j<ou.size(); j++) {
            cout<<"/"<<ou[j];
        }
        cout<<endl;
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_36792042/article/details/82463435