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
.
用一个数组记录当前层的长度,每一层的长度要依赖它前一层的长度。首先,根据'\n'将字符串分割成一个个小字符串,通过'\t'的个数判断所处层次。由第二个例子可知,当有多个子目录时,必定它的前面目录都更新了,才轮到它。因此,lev的覆盖不影响,它里面的已知值必定是当前目录的父目录。
class Solution {
public:
vector<string> split(string & s)
{
vector<string> ans;
stringstream ss(s);
string str;
while(getline(ss,str))
ans.push_back(str);
return ans;
}
int lengthLongestPath(string input) {
vector<string> str=split(input);
vector<int> lev(100,0);
int maxlen=0;
for(auto s:str)
{
int lv=s.find_last_of('\t')+1;//判断层数
lev[lv+1]=lev[lv]-lv+s.length()+1;//更新当前层的长度
if(s.find('.')!=-1) maxlen=max(maxlen,lev[lv+1]-1);//如果是文件,没有子目录了,判断一下
}
return maxlen;
}
};