update

kamyu104 · kamyu104 · commit 74346aad0bc4 · 2014-10-29T23:18:33.000+08:00
diff --git a/Python/combination-sum-ii.py b/Python/combination-sum-ii.py
@@ -1,5 +1,5 @@
-# # Time:  O(n)
-# # Space: O(n)
+# Time:  O(n! / m!(n-m)!)
+# Space: O(m)
 # 
 # Given a collection of candidate numbers (C) and a target number (T), 
 # find all unique combinations in C where the candidate numbers sums to T.
@@ -40,4 +40,4 @@ def combinationSumDFS(self, candidates, result, start, intermediate, target):
 if __name__ == "__main__":
     candidates, target = [10, 1, 2, 7, 6, 1, 5], 8
     result = Solution().combinationSum2(candidates, target)     
-    print result       
+    print result       
diff --git a/Python/combination-sum.py b/Python/combination-sum.py
@@ -1,5 +1,5 @@
-# Time:  O(n)
-# Space: O(n)
+# Time:  O(n^m)
+# Space: O(m)
 #
 # Given a set of candidate numbers (C) and a target number (T), 
 # find all unique combinations in C where the candidate numbers sums to T.
@@ -35,4 +35,4 @@ def combinationSumDFS(self, candidates, result, start, intermediate, target):
 if __name__ == "__main__":
     candidates, target = [2, 3, 6, 7], 7
     result = Solution().combinationSum(candidates, target)     
-    print result       
+    print result       
diff --git a/README.md b/README.md
@@ -283,8 +283,8 @@ Problem         |  Solution       |  Time           | Space           | Difficul
 --------------- | --------------- | --------------- | --------------- | -------------- | -----
 [Balanced Binary Tree] | [balanced-binary-tree.py] | _O(n)_| _O(logn)_| Easy           |
 [Binary Tree Maximum Path Sum]| [binary-tree-maximum-path-sum.py] | _O(n)_| _O(logn)_| Hard  |  
-[Combination Sum]| [combination-sum.py] | _O(n)_    | _O(n)_          | Medium         |
-[Combination Sum II]| [combination-sum-ii.py]| _O(n)_| _O(n)_         | Medium         |
+[Combination Sum]| [combination-sum.py] | _O(n^m)_    | _O(m)_          | Medium         |
+[Combination Sum II]| [combination-sum-ii.py]| _O(n! / m!(n-m)!)_| _O(m)_         | Medium         |
 [Combinations]| [combinations.py]  | _O(n!)_        | _O(n)_          | Medium         |
 [Generate Parentheses]| [generate-parentheses.py]| _O(4^n / n^(3/2))_ | _O(n)_   | Medium         |
 
