class Solution {
public:
    string simplifyPath(string path) {
        string ans="";
        vector<string>p;
        int i=0;
        while(i<path.size())
        {
            while(i<path.size()&&path[i]=='/')i++;
            if(i==path.size())break;
            string temp;
            while(i<path.size()&&path[i]!='/')
                temp+=path[i],i++;
            if(temp==".")continue;
            else if(temp=="..")
            {
                if(p.size())p.pop_back();
            }
            else p.push_back(temp);
        }
        for(int i=0;i<p.size();i++)ans=ans+'/'+p[i];
        if(ans.size()==0)ans="/";
        return ans;
    }
};



class Solution {
public:
    string simplifyPath(string path) {
        string ans;
        stack<string>st;
        int i=0;
        while(i<path.size())
        {
            while(i<path.size()&&path[i]=='/')i++;
            if(i==path.size())break;
            string temp="";
            while(i<path.size()&&path[i]!='/')
                temp+=path[i],i++;
            if(temp==".")continue;
            else if(temp=="..")
            {
                if(!st.empty())st.pop();
            }
            else st.push(temp);
        }
        while(!st.empty())
            ans='/'+st.top()+ans,st.pop();
        if(ans=="")ans="/";
        return ans;
    }
};