# 【Leetcode】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 subdir2subdir1 contains a file file1.ext and an empty second-level sub-directory subsubdir1subdir2contains 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.

public int lengthLongestPath(String input) {
List<Integer> lenOfLevel = new ArrayList<Integer>();
int max = 0, level = 0, preIdx = 0;
input = input + '\n';//使得每个路径token后都接一个\n，便于统一处理
boolean isFile = false;

for (int i = 0; i < input.length(); i++) {
if (input.charAt(i) == '.') {// 当前路径是否包含文件
isFile = true;
}
if (input.charAt(i) != '\n') // 换一行
continue;

int tokenLen = i - preIdx + 1;//一个目录token的长度
int tmp = tokenLen;
if (level - 1 >= 0) {// 如果当前路径有上一层
tmp += lenOfLevel.get(level - 1);// 则绝对路径长度需要加上上一层绝对路径长度
}

if (level <= lenOfLevel.size() - 1)// 当前路径有比它更深层的路径
lenOfLevel.set(level, tmp);
else

if (isFile) {// 当前绝对路径包含文件，则是一条可以计算长度的有效路径
max = Math.max(max, tmp);// 更新max
isFile = false;
}

int nIdx = i;// 更新待计算token的level
i++;
while (i < input.length() && input.charAt(i) == '\t') {
i++;
}
level = i - nIdx - 1;
preIdx = i;// 更新待计算token的起始位置
}
return max - 1 >= 0 ? max - 1 : 0;
}

08-24 5205

08-30 1052

08-22 1052

09-20 204

03-27 135

08-09 413

03-30 12

05-04 96

07-06 886

05-23 2090