LeetCode-Simplify Path

最新推荐文章于 2022-04-02 15:05:46 发布

所难

最新推荐文章于 2022-04-02 15:05:46 发布

阅读量318

点赞数

CC 4.0 BY-SA版权

分类专栏： Cracking LeetCode Math Game 文章标签： leetcode Simplify Path

本文链接：https://blog.youkuaiyun.com/HolyDominat/article/details/38473899

Cracking LeetCode 同时被 2 个专栏收录

152 篇文章

订阅专栏

Math Game

50 篇文章

订阅专栏

本文深入探讨了Unix风格路径的简化算法，包括基本案例和边缘情况分析，提供了详细代码实现及优化策略。

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

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".

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    string simplifyPath(string path) {
        path += "/";
        int length = path.size();
        stack<string> stk;
        string name;
        for (int i = 0; i < length; i++) {
            if (path[i] == '/') {
                if (name == "." || name == "") {
                } else if (name == "..") {
                    if (!stk.empty()) stk.pop();
                } else stk.push(name);
                name = "";
            } else
                name += path[i];
        }
        string result;
        while (!stk.empty()) {
            result = "/" + stk.top() + result;
            stk.pop();
        }
        if (result == "") return "/";
        return result;
    }
};</span>