216. 组合总和 III

题目链接

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

function combinationSum3(k: number, n: number): number[][] {
    const result:number[][] = [];
    const backtracking = (k: number, n: number, curN: number, curPath: number[]) => {
        if(curPath.length === k) {
            const sum = curPath.reduce((prev, next)=>{return prev+next});
            if (sum === n) {
                result.push(curPath);
            }
            return;
        }
        for(let i=curN;i<=9;i++){
            const newPath = [...curPath];
            newPath.push(i);
            backtracking(k,n,i+1,newPath);
        }
    };
    backtracking(k,n,1,[]);
    return result;
};

console.log(combinationSum3(3,7));
console.log(combinationSum3(3,9));
console.log(combinationSum3(4,1));