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

class Solution {
public:
    struct item{
        string name;
        int level, length;
        bool isFile;
        item(string x, int l, bool tag):  name(x), length(x.size()), level(l), isFile(tag) {};
    };
    int lengthLongestPath(string input) {
        input += '\n';
        int n = input.size(), level = 0, maxlen = 0;
        string tmp = "";
        bool isFile = false;
        stack<item*> s;
        for ( int i = 0; i < n; i++ ) {
            if ( input[i] == '.' ) isFile = true;
            if ( input[i] != '\n' and input[i] != '\t' ) tmp += input[i];
            if ( input[i] == '\t' ) level += 1;
            if ( input[i] == '\n' ) {
                item* newline = new item(tmp, level, isFile);
                while ( ! s.empty() and s.top()->level != level - 1) s.pop();
                if ( ! s.empty() ) newline->length += 1 + s.top()->length;
                if ( isFile ) maxlen = max(maxlen, newline->length);
                else s.push(newline);
                tmp = ""; level = 0; isFile = false;
            }
        }
        return maxlen;
    }
};

用一个stack来储存每一行的信息。难点是如何正确找到每个directory（或者file）的parent directory。对每一行信息都用一个level来标记（就是'\t'的个数）。它的parent directory就是往前数第一个level比自己少1的那一行。