Leetcode: Longest Absolute File Path-CSDN博客

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

The string "dir\n\tsubdir1\n\tsubdir2\n\t\tfile.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\n\tsubdir1\n\t\tfile1.ext\n\t\tsubsubdir1\n\tsubdir2\n\t\tsubsubdir2\n\t\t\tfile2.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.

Time Complexity: O(N)

The depth of the directory/file is calculated by counting how many "\t"s are there.
The time complexity is O(n) because each substring in the input string only goes into the stack once, and pops out from the stack once.

 1 public class Solution {
 2     public int lengthLongestPath(String input) {
 3         if (input==null || input.length()==0) return 0;
 4         int maxLen = 0;
 5         int curLen = 0;
 6         Stack<Integer> stack = new Stack<Integer>();
 7         String[] strs = input.split("\n");
 8         for (int i=0; i<strs.length; i++) {
 9             int level = countLev(strs[i]);
10             
11             while (stack.size() > level) {
12                 curLen -= stack.pop();
13             }
14             
15             // +1 here because a "/" needs to be counted at the end of each diretory
16             int strLen = strs[i].replaceAll("\t", "").length() + 1;
17             curLen += strLen;
18             
19             // if s contains ".", we have found a file
20             if (strs[i].contains(".")) {
21                 maxLen = Math.max(maxLen, curLen-1); //"/" is not needed at the end of the file
22             }
23             stack.push(strLen);
24         }
25         return maxLen;
26     }
27     
28     public int countLev(String str) {
29         String strReduced = str.replaceAll("\t", "");
30         return str.length() - strReduced.length();
31     }
32 }

Faster solution: avoid string operation

 1 public class Solution {
 2     public int lengthLongestPath(String input) {
 3         if (input==null || input.length()==0) return 0;
 4         int maxLen = 0;
 5         int curLen = 0;
 6         Stack<Integer> stack = new Stack<Integer>();
 7         String[] strs = input.split("\n");
 8         for (int i=0; i<strs.length; i++) {
 9             int level = countLev(strs[i]);
10             
11             while (stack.size() > level) {
12                 curLen -= stack.pop();
13             }
14             
15             int strLen = strs[i].length() - level + 1;
16             curLen += strLen;
17             
18             if (strs[i].contains(".")) {
19                 maxLen = Math.max(maxLen, curLen-1);
20             }
21             stack.push(strLen);
22         }
23         return maxLen;
24     }
25     
26     public int countLev(String str) {
27         int level = 0;
28         for (int i=0; i<str.length(); i++) {
29             if (str.charAt(i) == '\t') level++;
30             else break;
31             
32         }
33         return level;
34     }
35 }