leetcode388. Longest Absolute File Path

Dionysus_go 發布于2019-08-16 15:09 / 3080人閱讀

摘要：題目要求要求從字符串中找到最長的文件路徑。這里要注意，要求的是文件路徑，文件夾路徑不予考慮。文件和文件夾的區別在于文件中一定包含。這里代表根目錄平級，每多一個就多一層路徑，這一層路徑都是相對于當前的上層路徑的。

題目要求

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 subdir2. subdir1 contains a file file1.ext and an empty second-level sub-directory subsubdir1. subdir2 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.

要求從String字符串中找到最長的文件路徑。這里要注意，要求的是文件路徑，文件夾路徑不予考慮。文件和文件夾的區別在于文件中一定包含.。

這里代表根目錄平級，每多一個就多一層路徑，這一層路徑都是相對于當前的上層路徑的。
以dir subdir1 subdir2 file.ext為例
dir為第0層目錄
subdir1代表subdir1是第一層目錄，且其是當前父目錄dir的子目錄
subdir2代表subdir2為第一層目錄，且其是當前父目錄dir的子目錄，此時的一級父目錄從subdir1更新為subdir2
file.ext代表tfile.ext為二級目錄，位于當前一級目錄subdir2之下

思路和代碼

綜上分析，我們可以記錄一個信息，即當前每一級的目錄究竟是誰，每次只需要保留當前一級目錄已有的路徑長度即可。還是拿上面的例子dir subdir1 subdir2 file.ext：

遍歷完dir: 0級目錄長度為3
遍歷完
	subdir: 0級目錄長度為3, 1級目錄長度為11（dir/subdir1）
遍歷完
	subdir2: 0級目錄長度為3, 1級目錄長度為11（dir/subdir2）
遍歷完
		file.ext: 0級目錄長度為3, 1級目錄長度為11（dir/subdir2）, 2級目錄長度為20

綜上，最長的文件路徑長為20

代碼如下：

    public int lengthLongestPath(String input) {
         if(input==null || input.isEmpty()) return 0;
         //記錄當前每一級路徑對應的路徑長度
         List stack = new ArrayList();
         int left = 0, right = 0;
         int max = 0;
         int curDepth = 0;
         //當前遍歷的是文件還是文件夾
         boolean isFile = false;
         while(right < input.length()) {
             char c = input.charAt(right);
             if(c == "
" || c == "	") {
                 //如果是文件分割符的起點，則處理前面的字符串
                 if(right-1>=0 && input.charAt(right-1)!="
" && input.charAt(right-1)!="	") {
                     int length = right - left;
                     if(stack.isEmpty()) {
                         stack.add(length+1);
                     }else if(curDepth == 0){
                         stack.set(0, length+1);
                     }else{
                         int prev = stack.get(curDepth-1);
                         int now = prev + length + 1;
                         if(stack.size() <= curDepth) {
                             stack.add(now);
                         }else{
                             stack.set(curDepth, now);
                         }
                     }
                     if(isFile) {
                         max = Math.max(max, stack.get(curDepth)-1);
                     }
                     left = right;
                     isFile = false;
                 }
                 
                 //如果是文件分隔符的末尾，則處理文件分隔符，判斷是幾級路徑
                 if(right+1

GPU云服務器云服務器 Longest hp388服務器驅動 absolute position:absolute

文章版權歸作者所有，未經允許請勿轉載,若此文章存在違規行為，您可以聯系管理員刪除。

轉載請注明本文地址：http://specialneedsforspecialkids.com/yun/73302.html

[LeetCode] 388. Longest Absolute File Path

Problem Suppose we abstract our file system by a string in the following manner: The string dirntsubdir1ntsubdir2nttfile.ext represents: dir subdir1 subdir2 file.ext The directory dir ...

wawor4827 2019-08-16 13:36 評論0 收藏0
[Leetcode] Binary Tree Longest Consecutive Sequenc

摘要：遞歸法復雜度時間空間思路因為要找最長的連續路徑，我們在遍歷樹的時候需要兩個信息，一是目前連起來的路徑有多長，二是目前路徑的上一個節點的值。代碼判斷當前是否連續返回當前長度，左子樹長度，和右子樹長度中較大的那個 Binary Tree Longest Consecutive Sequence Given a binary tree, find the length of the lon...

xi4oh4o 2019-08-14 16:16 評論0 收藏0
leetcode 329. Longest Increasing Path in a Matrix

摘要：題目要求思路和代碼這里采用廣度優先算法加上緩存的方式來實現。我們可以看到，以一個節點作為開始構成的最長路徑長度是確定的。因此我們可以充分利用之前得到的結論來減少重復遍歷的次數。題目要求 Given an integer matrix, find the length of the longest increasing path. From each cell, you can ei...

heartFollower 2019-08-16 11:09 評論0 收藏0
[LeetCode] 329. Longest Increasing Path in a Matri

Problem Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move ou...

hss01248 2019-08-16 13:25 評論0 收藏0
[LeetCode] 329. Longest Increasing Path in a Matri

Problem Given an integer matrix, find the length of the longest increasing path. From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move ou...

antz 2019-08-06 12:26 評論0 收藏0