美文网首页算法学习
算法题--简化Linux路径

算法题--简化Linux路径

作者: 岁月如歌2020 | 来源:发表于2020-04-19 12:00 被阅读0次
    image.png

    0. 链接

    题目链接

    1. 题目

    Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.

    In a UNIX-style file system, a period . refers to the current directory. Furthermore, a double period .. moves the directory up a level.

    Note that the returned canonical path must always begin with a slash /, and there must be only a single slash / between two directory names. The last directory name (if it exists) must not end with a trailing /. Also, the canonical path must be the shortest string representing the absolute path.

    Example 1:

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

    Example 2:

    Input: "/../"
    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: "/home//foo/"
    Output: "/home/foo"
    Explanation: In the canonical path, multiple consecutive slashes are replaced by a single one.
    

    Example 4:

    Input: "/a/./b/../../c/"
    Output: "/c"
    

    Example 5:

    Input: "/a/../../b/../c//.//"
    Output: "/c"
    

    Example 6:

    Input: "/a//b////c/d//././/.."
    Output: "/a/b/c"
    

    2. 思路1:先用/分割+再组合

    先用/分割
    再组合:过程中遇到..尝试从结果列表中pop,遇到.忽略, 遇到''忽略, 否则添加到结果列表

    3. 代码

    class Solution1:
        def simplifyPath(self, path: str) -> str:
            array = path.split('/')
            result = list()
            for each in array:
                if each == '..':
                    if len(result) > 0:
                        result.pop()
                    continue
                elif each == '.':
                    continue
                elif len(each) == 0:
                    continue
                result.append(each)
    
            return '/' + '/'.join(result)
    
    
    solution = Solution1()
    print(solution.simplifyPath('/home/'))
    print(solution.simplifyPath('/../'))
    print(solution.simplifyPath('/home//foo/'))
    print(solution.simplifyPath('/a/./b/../../c/'))
    print(solution.simplifyPath('/a/../../b/../c//.//'))
    print(solution.simplifyPath('/a//b////c/d//././/..'))
    
    

    输出结果

    /home
    /
    /home/foo
    /c
    /c
    /a/b/c
    

    4. 结果

    image.png

    相关文章

      网友评论

        本文标题:算法题--简化Linux路径

        本文链接:https://www.haomeiwen.com/subject/bpjubhtx.html