Leetcode 388 Longest Absolute File Path

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.

不同的level有不同数量的\t,要找到最长的一条路径，很容易就想要用stack

现将input按照顺序split 然后如果level高于目前栈顶，就先pop直到找到合适parent再压栈

如果低直接压栈，最后判断是不是文件，是的话就计算整条路径的长度

public class Solution {
    public int lengthLongestPath(String input) {
        String[] list = input.split("\n");
        Stack<Integer> s = new Stack<>();
        int result = 0;
        s.push(0);
        for(int i = 0;i<list.length; i++){
            int level = list[i].lastIndexOf("\t")+1;
            
            while(level+1<s.size()){
                s.pop();
            }
 
            int length = s.peek() + list[i].length() - (level)+1 ;
  
            s.push(length);
            if(list[i].contains(".")){
                result = Math.max(result,length);
            }
        }
        return result;
    }
}