Update increasing-subsequences.py

Return result does not count in space complexity.
rui-yan · Sep 12, 2018 · e1fa441 · e1fa441
1 parent e9deacf
commit e1fa441
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/Python/increasing-subsequences.py b/Python/increasing-subsequences.py
@@ -1,5 +1,5 @@
 # Time:  O(n * 2^n)
-# Space: O(n^2)
+# Space: O(n) #Longest possible path in tree, which is if all numbers are increasing.
 
 # Given an integer array, your task is
 # to find all the different possible increasing