Update 159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md

0xkookoo · web-flow · commit dfa46f98dcdd · 2018-09-24T11:15:14.000-05:00
diff --git a/docs/Leetcode_Solutions/Python/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md b/docs/Leetcode_Solutions/Python/159._Longest_Substring_with_At_Most_Two_Distinct_Characters.md
@@ -28,6 +28,7 @@ Explanation: t is "aabbb" which its length is 5.
 ## 解题方案
 
 > 思路 1
+******- 时间复杂度: O(N)******- 空间复杂度: O(N)******
 
 
 ```python
