Runtime: 101 ms (Top 24.96%) | Memory: 22 MB (Top 28.36%)

Author: AnasImloul

scripts/algorithms/C/Combination Sum/Combination Sum.cpp

@@ -1,19 +1,20 @@
+// Runtime: 101 ms (Top 24.96%) | Memory: 22 MB (Top 28.36%)
 class Solution {
     void combination(vector<int>& candidates, int target, vector<int> currComb, int currSum, int currIndex, vector<vector<int>>& ans){
         if(currSum>target) return; //backtrack
         if(currSum==target){
             ans.push_back(currComb); //store the solution and backtrack
             return;
         }
-        
+
         for(int i=currIndex; i<candidates.size(); i++){ //try all possible options for the next level
             currComb.push_back(candidates[i]); //put 1 option into the combination
             currSum+=candidates[i];
             combination(candidates, target, currComb, currSum, i, ans); //try with this combination, whether it gives a solution or not.
             currComb.pop_back(); //when this option backtrack to here, remove this and go on to the next option.
             currSum-=candidates[i];
         }
-        
+
     }
 public:
     vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
@@ -23,4 +24,3 @@ class Solution {
         return ans;
     }
 };
-