388_Longest_Absolute_File_Path

Author: qiyuangong

README.md

@@ -85,10 +85,11 @@
 | 339 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) ♥ | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/339_Nested_List_Weight_Sum.py) | Depth-first recursion |
 | 340 | [Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/) ♥ | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/340_Longest_Substring_with_At_Most_K_Distinct_Characters.py) | Maintain a sliding window with at most k distinct characters and a count for this window. Note that the start position need a loop to update.|
 | 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) ♥ | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/351_Android_Unlock_Patterns.py) |  |
+| 388 | [Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/388_Longest_Absolute_File_Path.py) | 1. Store last length and rindex, O(n) and O(n) |
 
 
 | # | To Understand |
 |---| ----- |
 | 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) |
-| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) ♥ |
+| 351 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) ♥ 
 

python/388_Longest_Absolute_File_Path.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def lengthLongestPath(self, input):
+        """
+        :type input: str
+        :rtype: int
+        """
+        if input is None or len(input) == 0:
+            return 0
+        lines = input.split('\n')
+        last_level_len = [0] * (len(lines) + 1); max_len = 0
+        for line in lines:
+            try:
+                level = line.rindex('\t') + 1
+            except:
+                level = 0
+            cur_len = last_level_len[level + 1] = last_level_len[level] + len(line) - level + 1
+            if '.' in line:
+                max_len = max(max_len, cur_len - 1)
+        return max_len
+
+if __name__ == '__main__':
+    s = Solution()
+    print s.lengthLongestPath("dir\n    file.txt")
+