Merge pull request soapyigu#73 from soapyigu/DFS

soapyigu · web-flow · commit 6d51d0a400cb · 2016-06-30T22:12:21.000-07:00
[DFS] fix Space Complexity of Combination I, II, III
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)
  *
  */
 

Original file line number	Diff line number	Diff line change
`@@ -2,7 +2,7 @@`
`2`	`2`	`* Question Link: https://leetcode.com/problems/combination-sum/`
`3`	`3`	`* Primary idea: Classic Depth-first Search`
`4`	`4`	`*`
`5`		`- * Time Complexity: O(n^n), Space Complexity: O(n^n)`
	`5`	`+ * Time Complexity: O(n^n), Space Complexity: O(2^n - 1)`
`6`	`6`	`*`
`7`	`7`	`*/`
`8`	`8`