Update Combination Sum II.java

varunu28 · web-flow · commit d1c76836d08f · 2022-09-12T15:33:25.000-07:00
diff --git a/Medium/Combination Sum II.java b/Medium/Combination Sum II.java
@@ -1,26 +1,25 @@
 class Solution {
   public List<List<Integer>> combinationSum2(int[] candidates, int target) {
-    List<List<Integer>> list = new ArrayList<>();
+    List<List<Integer>> result = new ArrayList<>();
     Arrays.sort(candidates);
-    helper(candidates, 0, target, new ArrayList<>(), list);
-    return list;
+    helper(candidates, target, result, new ArrayList<>(), 0);
+    return result;
   }
   
-  private void helper(int[] candidates, int idx, int target, List<Integer> temp, List<List<Integer>> list) {
-    if (target == 0) {
-      list.add(new ArrayList<>(temp));
-      return;
-    }
-    if (target < 0) {
+  private void helper(int[] candidates, int target, List<List<Integer>> result, List<Integer> currCombination, int idx) {
+    if (target <= 0) {
+      if (target == 0) {
+        result.add(new ArrayList<>(currCombination));
+      }
       return;
     }
     for (int i = idx; i < candidates.length; i++) {
-      if (i > idx && candidates[i] == candidates[i - 1]) { 
+      if (i > idx && candidates[i] == candidates[i - 1]) {
         continue;
       }
-      temp.add(candidates[i]);
-      helper(candidates, i + 1, target - candidates[i], temp, list);
-      temp.remove(temp.size() - 1);
+      currCombination.add(candidates[i]);
+      helper(candidates, target - candidates[i], result, currCombination, i + 1);
+      currCombination.remove(currCombination.size() - 1);
     }
   }
 }
