leetcode 71: Simplify Path

最新推荐文章于 2024-02-07 23:12:57 发布

mikefan1991

最新推荐文章于 2024-02-07 23:12:57 发布

阅读量214

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/mikefan1991/article/details/47266677

版权

leetcode 专栏收录该内容

201 篇文章 0 订阅

订阅专栏

So fucked up by all detailed corner cases!!!

class Solution {
public:
    string simplifyPath(string path) {
        string res;
        res+=path[0];
        int dot_num=0;
        for(int i=1;i<path.size();i++)
        {
            if(path[i]=='/')
            {
                if(path[i-1]>='a'&&path[i-1]<='z')
                    res+=path[i];
                else if(dot_num==1&&path[i-1]=='.')
                    res.pop_back();
                else if(dot_num==2&&res.size()!=3&&path[i-1]=='.')
                {
                    for(int j=0;j<3;j++)
                        res.pop_back();
                    while(res[res.size()-1]!='/')
                        res.pop_back();
                }
                else if(dot_num==2&&res.size()==3)
                {
                    res.pop_back();
                    res.pop_back();
                }
                else if(path[i-1]=='/')
                    continue;
                else
                {
                    res+='/';
                }
                dot_num=0;
            }
            else if(path[i]=='.')
            {
                res+='.';
                dot_num++;
            }
            else
                res+=path[i];
        }
        if(res[res.size()-1]=='.')
        {
            if(dot_num==2&&res.size()!=3)
            {
                for(int i=0;i<3;i++)
                    res.pop_back();
                while(res[res.size()-1]!='/')
                    res.pop_back();
            }
            else if(dot_num==2&&res.size()==3)
            {
                res.pop_back();
                res.pop_back();
            }
            else if(dot_num==1)
                res.pop_back();
        }
        while(res[res.size()-1]=='/'&&res.size()>1)
            res.pop_back();
        return res;
    }
};

Updated version, looks cleaner

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> dir;
        int i=0,j=1;
        int len=path.length();
        if(path[len-1]!='/')//add a / at the end if there is no
        {
            path.push_back('/');
            len++;
        }
        while(j<len)
        {
            if(path[j]=='/')
            {
                string temp=path.substr(i,j-i);
                if(temp=="/.."&&!dir.empty())//delete previous directory
                    dir.pop_back();
                else if(temp!="/"&&temp!="/."&&temp!="/..")
                    dir.push_back(temp);
                i=j;
            }
            j++;
        }
        if(dir.empty())
            return "/";
        string res;
        for(int i=0;i<dir.size();i++)
            res+=dir[i];
        return res;
    }
};