fix: complexity of combination sum

heozeop · web-flow · commit 0e552110ef57 · 2024-08-29T10:22:59.000+09:00
diff --git a/combination-sum/heozeop.cpp b/combination-sum/heozeop.cpp
@@ -1,5 +1,7 @@
-// Time Complexity: O(n^2)
-// Spatial Complexity: O(n);
+// Time Complexity: O(n^target);
+//    - target에 비례하는 tree 깊이에 따라 n번 순회 발생
+// Spatial Complexity: O(target);
+//    - target에 비례하는 visited vector, answer vector만 있으면 됨.
 
 class Solution {
 public:
