[leetcode] 388. Longest Absolute File Path 解题报告

题目链接: https://leetcode.com/problems/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

思路: 这是google的OA题目, 改了一些, 原来是求图片文件的路径和, 这里只求最大的文件数, 但是思路还是一样的.

可以借助一个栈来保存当前层的路径, 层数可以利用tab字符的个数来确定, 如果当前行的层数大于栈顶元素并且非文件, 就可以让其进入栈, 否则如果当前行是文件就可以比较大小, 或者如果当前行是目录但是深度小于等于栈顶元素, 就可以将栈顶元素出栈, 直到为空或者小于当前行的深度.

代码如下:

class Solution {
public:
    int lengthLongestPath(string input) {
        input+= '\n';
        int len = input.size(), ans = 0, spaceCnt = 0, curPathLen =0, dotFlag = 0;
        stack<pair<string, int> > st;
        string curDir, extension;
        for(int i = 0; i < len; i++)
        {
            if(input[i]!='\n')
            {
                if(input[i]!='\t') curDir += input[i];
                if(dotFlag) extension += input[i];
                if(input[i]=='\t') spaceCnt++;
                if(input[i]=='.') dotFlag = 1;
                continue;
            }  
            while(!st.empty() && spaceCnt <= st.top().second)
            {
                curPathLen -= st.top().first.size();
                st.pop();
            }
            if(dotFlag) ans = max(curPathLen + (int)curDir.size() + 1, ans);
            else
            {
                st.push(make_pair("/"+ curDir, spaceCnt));
                curPathLen += curDir.size() + 1;
            }
            extension = "", dotFlag = 0, spaceCnt = 0, curDir = "";
        }
        return ans==0?0:ans-1;
    }
};