[DFS] fix Space Complexity of Combination I, II, III

AnselmeKotchap · Jul 1, 2016 · fb1d6bf · fb1d6bf
1 parent 117c665
commit fb1d6bf
Show file tree

Hide file tree

Showing 3 changed files with 3 additions and 3 deletions.
diff --git a/DFS/CombinationSum.swift b/DFS/CombinationSum.swift
@@ -2,7 +2,7 @@
  * Question Link: https://leetcode.com/problems/combination-sum/
  * Primary idea: Classic Depth-first Search
  * 
- * Time Complexity: O(n^n), Space Complexity: O(n^n)
+ * Time Complexity: O(n^n), Space Complexity: O(2^n - 1)
  *
  */
 

diff --git a/DFS/combinationSumII.swift b/DFS/combinationSumII.swift
@@ -2,7 +2,7 @@
  * Question Link: https://leetcode.com/problems/combination-sum-ii/
  * Primary idea: Classic Depth-first Search
  * 
- * Time Complexity: O(n!), Space Complexity: O(n!)
+ * Time Complexity: O(n!), Space Complexity: O(2^n - 2)
  *
  */
 

diff --git a/DFS/combinationSumIII.swift b/DFS/combinationSumIII.swift
@@ -2,7 +2,7 @@
  * Question Link: https://leetcode.com/problems/combination-sum-iii/
  * Primary idea: Classic Depth-first Search
  * 
- * Time Complexity: O(n!), Space Complexity: O(n!)
+ * Time Complexity: O(n!), Space Complexity: O(nCk)
  *
  */