216. Combination Sum III [Medium]

https://leetcode.com/problems/combination-sum-iii/

Find all valid combinations of k numbers that sum up to n such that the following conditions are true:

• Only numbers 1 through 9 are used.
• Each number is used at most once.

Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order.

Example 1:

Input: k = 3, n = 7
Output: [[1,2,4]]
Explanation:
1 + 2 + 4 = 7
There are no other valid combinations.

Example 2:

Input: k = 3, n = 9
Output: [[1,2,6],[1,3,5],[2,3,4]]
Explanation:
1 + 2 + 6 = 9
1 + 3 + 5 = 9
2 + 3 + 4 = 9
There are no other valid combinations.

Example 3:

Input: k = 4, n = 1
Output: []
Explanation: There are no valid combinations. [1,2,1] is not valid because 1 is used twice.

Example 4:

Input: k = 3, n = 2
Output: []
Explanation: There are no valid combinations.

Example 5:

Input: k = 9, n = 45
Output: [[1,2,3,4,5,6,7,8,9]]
Explanation:
1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45
There are no other valid combinations.

Constraints:

• 2 <= k <= 9
• 1 <= n <= 60

---

算法思路：

回溯

class Solution {
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        if (k > n || n > 45 || n < 3 || k * 9 <= n) return {};
        vector<int> ans;
        vector<vector<int>> res;
        getCombinations(k, n, 1, ans, res);
        return res;
    }
private:
    void getCombinations(int k, int target, int start, vector<int>& ans, 
                        vector<vector<int>>& res) {
        if (k == 1) {
            if (start <= target && target <= 9) {
                ans.push_back(target);
                res.push_back(ans);
                ans.pop_back();
            }
            return;
        }
        for (int i = start; i <= 9; i++) {
            if (i > target) return;
            ans.push_back(i);
            getCombinations(k - 1, target - i, i + 1, ans, res);
            ans.pop_back();
        }
    }
};