zoukankan      html  css  js  c++  java
  • 【leetcode】388. Longest Absolute File Path

    题目如下:

    Suppose we abstract our file system by a string in the following manner:

    The string "dir subdir1 subdir2 file.ext"represents:

    dir
        subdir1
        subdir2
            file.ext
    

    The directory dir contains an empty sub-directory subdir1 and a sub-directory subdir2 containing a file file.ext.

    The string "dir subdir1 file1.ext subsubdir1 subdir2 subsubdir2 file2.ext"represents:

    dir
        subdir1
            file1.ext
            subsubdir1
        subdir2
            subsubdir2
                file2.ext
    

    The directory dir contains two sub-directories subdir1 and subdir2subdir1 contains a file file1.ext and an empty second-level sub-directory subsubdir1subdir2 contains a second-level sub-directory subsubdir2 containing a file file2.ext.

    We are interested in finding the longest (number of characters) absolute path to a file within our file system. For example, in the second example above, the longest absolute path is "dir/subdir2/subsubdir2/file2.ext", and its length is 32 (not including the double quotes).

    Given a string representing the file system in the above format, return the length of the longest absolute path to file in the abstracted file system. If there is no file in the system, return 0.

    Note:

    • The name of a file contains at least a . and an extension.
    • The name of a directory or sub-directory will not contain a ..

    Time complexity required: O(n) where n is the size of the input string.

    Notice that a/aa/aaa/file1.txt is not the longest file path, if there is another path aaaaaaaaaaaaaaaaaaaaa/sth.png.

    解题思路:我的方法很简单,首先把input按' '分割,接下来判断分割后的每一个子串前缀有几个' ',并以' '的个数作为key值将子串存入字典中,而这个子串的上一级目录是(key-1)在字典中的最后一个元素。遍历所有的子串后即可求得最大长度。

    代码如下:

    class Solution(object):
        def lengthLongestPath(self, input):
            """
            :type input: str
            :rtype: int
            """
            #print input
            dic = {}
            dic[0] = ['']
            res = 0
            if input.count('.') < 1:
                return 0
            itemlist = input.split('
    ')
            for i in itemlist:
                count = i.count('	') + 1
                if count not in dic:
                    dic[count] = [dic[count-1][-1] + '/' + i.replace('	','')]
                else:
                    dic[count].append(dic[count-1][-1]+ '/'+i.replace('	',''))
                #print len(dic[count][-1])-1,dic[count][-1]
                if dic[count][-1].count('.') >= 1:
                    res = max(res,len(dic[count][-1])-1)
            #print dic
            return res
  • 相关阅读:
    给object数组进行排序(排序条件是每个元素对象的属性个数)
    转化一个数字数组为function数组(每个function都弹出相应的数字)
    找出数字数组中最大的元素(使用Math.max函数)
    JavaFX学习笔记索引
    JavaFX学习:第一个程序 Hello World
    Notion笔记链接
    Windows 下 Chocolatey 的安装与使用
    Bootstrap3 文档整理
    (转)OpenCV视频生成报错 Incorrect library version loaded Could not open codec ‘libopenh264‘: Unspecified error
    OpenCV不能读取 mp4 的问题(转)
  • 原文地址:https://www.cnblogs.com/seyjs/p/10208083.html
Copyright © 2011-2022 走看看