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. subdir2contains 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.

通过使用unordered_map将深度和总长度相互映射，通过更新map就能得到最长绝对文件路径。

找到'\n'时判断当前深度是否是文件还是文件夹，找到‘\t’深度自增一(每次遍历到'\n',要level=0,因为'\t'就是相对应深度)。

class Solution {
public:
    int lengthLongestPath(string input) {
        int res = 0,level=0,n=input.length();
        unordered_map<int,int> um;
        um[0]=0;
        for(int i=0;i<n;i++)
        {
            int start=i;
            while(i<n&&input[i]!='\n'&&input[i]!='\t') ++i;
            if (i>=n||input[i]=='\n')
            {
                string substring=input.substr(start,i-start);
                if (substring.find('.')!=string::npos)
                {
                    res=max(res,um[level]+(int)(substring.length()));
                }
                else
                {
                    level++;
                    um[level]=um[level-1]+substring.length()+1;
                }
                level=0;//为了更新映射表
            }
            else
            {
                level++;
            }
        }
        return res;
    }
};

采用字符串输入流读取字符串,这样可以通过getline和'\n'将字符串分成几段，‘\t’相对应个数+1为深度,哈希表建立深度和总长度的关系。

class Solution {
public:
    int lengthLongestPath(string input) {
        int res = 0,level=0;//二叉树的最小深度为1.
        unordered_map<int,int> um;
        um[0]=0;
        istringstream ist(input);
        string substring;
        while (getline(ist,substring))
        {
            string t=substring.find_last_of('\t')!=string::npos?substring.substr(substring.find_last_of('\t')+1):substring;
            level=substring.length()-t.length();//上一个深度。
            if (t.find('.')!=string::npos)
            {
                res=max(res,um[level]+(int)t.length());
            }
            else
            {
                um[level+1]=um[level]+t.length()+1;//计算当前深度的总长度。
            }
        }
        return res;
    }
};