leetcode - 71. Simplify Path

最新推荐文章于 2024-08-29 16:23:51 发布

KpLn_HJL

最新推荐文章于 2024-08-29 16:23:51 发布

阅读量526

点赞数 7

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/sinat_41679123/article/details/136426138

版权

OJ题目记录专栏收录该内容

515 篇文章 1 订阅

订阅专栏

Description

Given a string path, which is an absolute path (starting with a slash ‘/’) to a file or directory in a Unix-style file system, convert it to the simplified canonical path.

In a Unix-style file system, a period ‘.’ refers to the current directory, a double period ‘…’ refers to the directory up a level, and any multiple consecutive slashes (i.e. ‘//’) are treated as a single slash ‘/’. For this problem, any other format of periods such as ‘…’ are treated as file/directory names.

The canonical path should have the following format:

The path starts with a single slash '/'.
Any two directories are separated by a single slash '/'.
The path does not end with a trailing '/'.
The path only contains the directories on the path from the root directory to the target file or directory (i.e., no period '.' or double period '..')
Return the simplified canonical path.

Example 1:

Input: path = "/home/"
Output: "/home"
Explanation: Note that there is no trailing slash after the last directory name.

Example 2:

Input: path = "/../"
Output: "/"
Explanation: Going one level up from the root directory is a no-op, as the root level is the highest level you can go.

Example 3:

Input: path = "/home//foo/"
Output: "/home/foo"
Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.

Constraints:

1 <= path.length <= 3000
path consists of English letters, digits, period '.', slash '/' or '_'.
path is a valid absolute Unix path.

Solution

Split the path by /, and for each part, if it’s a ., do thing, if it’s '', do thing, if it’s .., pop the stack.

Time complexity: $o (n)$
Space complexity: $o (n)$

Code

class Solution:
    def simplifyPath(self, path: str) -> str:
        stack = []
        paths = path.split('/')
        for each_path in paths:
            if each_path == '..':
                if stack:
                    stack.pop()
            elif each_path == '.':
                continue
            elif len(each_path) == 0:
                continue
            else:
                stack.append(each_path)
        return '/' + '/'.join(stack)