leetcode: 71. Simplify Path

最新推荐文章于 2024-09-18 20:11:15 发布

JNingWei

最新推荐文章于 2024-09-18 20:11:15 发布

阅读量426

点赞数 1

分类专栏： LeetCode-Python 文章标签： leetcode

本文链接：https://blog.csdn.net/jningwei/article/details/78581517

版权

LeetCode-Python 专栏收录该内容

134 篇文章 30 订阅

订阅专栏

Problem

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

Idea

# 思路：
# 1. split "/" 形成List, 同时剔除 "." 和 ""
# 2. 如果 ".." 就　pop 前面的
# 3. 反之则入队

AC

Stack：

class Solution():
    def simplifyPath(self, path):
        tokens, stack = [p for p in path.split("/") if p!="." and p!=""], []
        for t in tokens:
            if t == "..":
                if stack:
                    stack.pop()
            else:
                stack.append(t)
        return "/" + "/".join(stack)


if __name__ == "__main__":
    assert Solution().simplifyPath("/home//foo/") == '/home/foo'