71. Simplify Path(java)

最新推荐文章于 2020-02-18 13:12:52 发布

katrina95

最新推荐文章于 2020-02-18 13:12:52 发布

阅读量341

点赞数

CC 4.0 BY-SA版权

分类专栏：计算机算法文章标签： java

本文链接：https://blog.csdn.net/katrina95/article/details/79276264

计算机算法专栏收录该内容

221 篇文章

订阅专栏

本文介绍了一种简化Unix风格文件路径的方法，通过使用栈数据结构来处理各种特殊情况，如多个连续的斜杠、当前目录符号（.）及上级目录符号（..）。文章提供了一个具体的Java实现示例。

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

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

这道题主要考察对各种case的考虑，具体实现上就是字符串的处理，另外就是最后的reverse有点麻烦。

public String simplifyPath(String path) {
        //special case
        if (path.length() == 0) return "";
        if (path.length() == 1) return "/";
        //general case
        Stack<String> stack = new Stack<>();
        String[] strings = path.split("/");
        for (int i = 0; i < strings.length; i++) {
            String str = strings[i];
            if (str.equals(".") || str.equals("")) {
                continue;
            } else if (str.equals("..")) {
                if (!stack.isEmpty()) {
                    stack.pop();
                }
            } else {
                stack.push(str);
            }
        }
        if (stack.isEmpty()) return "/";
        String res = "";
        while (!stack.isEmpty()) {
            res = "/" + stack.pop() + res;
        }
        return res;
    }