LeetCode 388. Longest Absolute File Path（栈）

最新推荐文章于 2024-09-28 07:30:00 发布

da_kao_la

最新推荐文章于 2024-09-28 07:30:00 发布

阅读量114

点赞数

分类专栏： LeetCode 文章标签： LeetCode Medium Java 栈

本文链接：https://blog.csdn.net/da_kao_la/article/details/102597253

版权

LeetCode 专栏收录该内容

371 篇文章 0 订阅

订阅专栏

Longest Absolute File Path

Medium

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.

题意

给定一个字符串表示的文件系统目录结构，求解绝对路径最长的文件的路径长度

思路

用栈保存当前目录的绝对路径长度，根据目录/文件名开头\t的个数维护栈

代码

class Solution {
    public int lengthLongestPath(String input) {
        LinkedList<Integer> accuLengths = new LinkedList<>();
        String[] paths = input.split("\n");
        int tabCnt = 0, ans = 0, stackLen = 0;
        for (String path: paths) {
            tabCnt = path.lastIndexOf('\t') + 1;
            while (stackLen > tabCnt) {
                accuLengths.removeLast();
                --stackLen;
            }
            if (path.indexOf('.') != -1) {
                ans = Math.max(ans, stackLen == 0? path.length(): accuLengths.getLast() + path.length() - tabCnt);
            } else {
                accuLengths.add(stackLen == 0? path.length() + 1: accuLengths.getLast() + path.length() - tabCnt + 1);
                ++stackLen;
            }
        }
    return ans;
    }
}