[leetcode] 71. Simplify Path

最新推荐文章于 2024-10-01 05:04:32 发布

TstsUgeg

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量426

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/TstsUgeg/article/details/51792902

版权

leetcode 专栏收录该内容

254 篇文章 0 订阅

订阅专栏

Given an absolute path for a file (Unix-style), simplify it.

For example,
path = "/home/", => "/home"
path = "/a/./b/../../c/", => "/c"

Corner Cases:

Did you consider the case where path = "/../"?
In this case, you should return "/".
Another corner case is the path might contain multiple slashes '/' together, such as "/home//foo/".
In this case, you should ignore redundant slashes and return "/home/foo".

这道题是简化unix风格绝对路径，题目难度为Medium。

依据“/”分割路径字符串，将分割后的文件夹（或文件）名称（记为字符串curFolder）依次缓存下来，依据curFolder进行分类处理：

如果curFolder为空，表明是连续的“/”，不做处理；
如果curFolder不空，依据如下分类处理之后清空curFolder：

为“.”：代表当前文件夹，不处理；
为“..”：代表回退到上层文件夹，此时删除上一文件夹，需要判断缓存是否为空，如果为空不处理；
其他情况依次将curFolder加入缓存。

最后再将各级文件夹串接为最终简化后的路径字符串，注意最后没有“/”，具体代码：

class Solution {
public:
    string simplifyPath(string path) {
        vector<string> folders;
        string curFolder = "";
        string ret = "/";
        
        path += '/';
        for(auto ch:path) {
            if(ch == '/') {
                if(!curFolder.empty()) {
                    if(curFolder == "..") {
                        if(!folders.empty()) folders.pop_back();
                    }
                    else if(curFolder != ".") {
                        folders.push_back(curFolder);
                    }
                    curFolder = "";
                }
            }
            else curFolder += ch;
        }
        
        for(int i=0; i+1<folders.size(); ++i)
            ret += (folders[i] + '/');
        if(!folders.empty()) ret += folders.back();
        
        return ret;
    }
};