leetcode388. Longest Absolute File Path

Dionysus_go 发布于2019-08-16 15:09 / 2950人阅读

摘要：题目要求要求从字符串中找到最长的文件路径。这里要注意，要求的是文件路径，文件夹路径不予考虑。文件和文件夹的区别在于文件中一定包含。这里代表根目录平级，每多一个就多一层路径，这一层路径都是相对于当前的上层路径的。

题目要求

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

专线服务混合云 Longest hp388服务器驱动 absolute position:absolute

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/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