Longest Absolute File Path LeetCode solution in Python

1
class Solution:
2
    def lengthLongestPath(self, input: str) -> int:
3
        if "." not in input:
4
            return 0
5

6
        a = input.split("\n")
7
        files = []
8
        for i in a:
9
            if "." in i:
10
                files.append(i)
11

12
        final = []
13
        for i in range(len(files)):
14
            file = files[i]
15
            lvl = file.count("\t")
16
            idx = a.index(file) - 1
17
            save = [files[i].replace("\t", "")]
18
            for j in range(lvl):
19
                while a[idx].count("\t") != lvl - 1:
20
                    idx -= 1
21
                lvl = a[idx].count("\t")
22
                save.append(a[idx].replace("\t", ""))
23
                idx -= 1
24
            final.append(save)
25

26
        final = list(map("/".join, final))
27
        return len(max(final, key=len))