package com.fishercoder.solutions;

import java.util.ArrayList;
import java.util.List;

/**
 * 216. Combination Sum III
 *
 * Find all possible combinations of k numbers that add up to a number n,
 * given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.

 Example 1:
 Input: k = 3, n = 7
 Output: [[1,2,4]]

 Example 2:
 Input: k = 3, n = 9
 Output: [[1,2,6], [1,3,5], [2,3,4]]
 */
public class _216 {

    public static class Solution1 {
        public List<List<Integer>> combinationSum3(int k, int n) {
            List<List<Integer>> result = new ArrayList();
            int[] nums = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9};
            backtracking(k, n, nums, 0, new ArrayList(), result);
            return result;
        }

        void backtracking(int k, int n, int[] nums, int start, List<Integer> curr, List<List<Integer>> result) {
            if (n > 0) {
                for (int i = start; i < nums.length; i++) {
                    curr.add(nums[i]);
                    backtracking(k, n - nums[i], nums, i + 1, curr, result);
                    curr.remove(curr.size() - 1);
                }
            } else if (n == 0 && curr.size() == k) {
                result.add(new ArrayList(curr));
            }
        }
    }
}

@@ -85,352 +85,8 @@
 t;%0A%0A
-/**%0A * 216. Combination Sum III%0A *%0A * Find all possible combinations of k numbers that add up to a number n,%0A * given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.%0A%0A Example 1:%0A Input: k = 3, n = 7%0A Output: %5B%5B1,2,4%5D%5D%0A%0A Example 2:%0A Input: k = 3, n = 9%0A Output: %5B%5B1,2,6%5D, %5B1,3,5%5D, %5B2,3,4%5D%5D%0A */%0A
 publ

refactor 216