题目：

题解：

func lengthLongestPath(input string) (ans int) {n := len(input)level := make([]int, n+1)for i := 0; i < n; {// 检测当前文件的深度depth := 1for ; i < n && input[i] == '\t'; i++ {depth++}// 统计当前文件名的长度length, isFile := 0, falsefor ; i < n && input[i] != '\n'; i++ {if input[i] == '.' {isFile = true}length++}i++ // 跳过换行符if depth > 1 {length += level[depth-1] + 1}if isFile {ans = max(ans, length)} else {level[depth] = length}}return
}func max(a, b int) int {if b > a {return b}return a
}