g0001_0100.s0039_combination_sum.Solution.dart Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking
// #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion
// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_10_04_Time_316_ms_(96.88%)_Space_150_MB_(62.50%)

class Solution {
  List> combinationSum(List coins, int amount) {
    List> ans = [];
    List subList = [];
    combinationSumRec(coins.length, coins, amount, subList, ans);
    return ans;
  }

  void combinationSumRec(int n, List coins, int amount, List subList, List> ans) {
    if (amount == 0 || n == 0) {
      if (amount == 0) {
        // Create a new list from subList and add to ans
        ans.add(List.from(subList));
      }
      return;
    }

    if (amount - coins[n - 1] >= 0) {
      subList.add(coins[n - 1]);
      combinationSumRec(n, coins, amount - coins[n - 1], subList, ans);
      // Remove the last element
      subList.removeLast();
    }

    combinationSumRec(n - 1, coins, amount, subList, ans);
  }
}