Simplify Path

最新推荐文章于 2020-02-07 13:43:23 发布

原创最新推荐文章于 2020-02-07 13:43:23 发布 · 477 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #算法 #unixPath #simplify

leetcode 专栏收录该内容

18 篇文章

订阅专栏

本文介绍如何使用栈结构简化Unix风格的绝对路径，并通过示例解释了特殊情况的处理，如空路径、循环路径和冗余斜杠。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

原题

https://leetcode.com/problems/simplify-path/。
Given an absolute path for a file (Unix-style), simplify it.

For example,
path = “/home/”, => “/home”
path = “/a/./b/../../c/”, => “/c”
click to show corner cases.

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文件路径。

思路

其实没什么好讲的，利用栈的结构，然后分情况讨论就行。

代码

class Solution {
public:
    string simplifyPath(string path) {
        list<string> theList;
        string temp, res;
        stringstream ss(path);
        while(getline(ss,temp,'/'))
        {
            if(temp == "" || temp == ".") continue;
            if(temp == ".." && !theList.empty()) theList.pop_back();
            else if(temp != "..") theList.push_back(temp);
        }
        for(string theTemp : theList) res += "/" + theTemp;
        return res.empty() ? "/" : res;
    }
};