题目：​​原题链接​​（中等）

标签：栈、字符串

解法一：

class Solution:
    def lengthLongestPath(self, input: str) -> int:
        lines = input.split("\n")

        ans = 0

        stack = []  # 当前路径栈
        for line in lines:
            num = line.count("\t")
            while len(stack) > num:
                stack.pop()

            name = line.replace("\t", "")

            # 处理当前为文件的情况
            if "." in line:
                ans = max(ans, sum(len(n) for n in stack) + len(stack) + len(name))
            else:
                stack.append(name)

        return ans