forked from Hazrat-Ali9/JavaScript-Problem-Solving
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcombinations.js
More file actions
42 lines (37 loc) · 723 Bytes
/
combinations.js
File metadata and controls
42 lines (37 loc) · 723 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/**
* Combinations
*
* Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
*
* For example,
* If n = 4 and k = 2, a solution is:
*
* [
* [2,4],
* [3,4],
* [2,3],
* [1,2],
* [1,3],
* [1,4],
* ]
*/
/**
* @param {number} n
* @param {number} k
* @return {number[][]}
*/
const combine = (n, k) => {
const results = [];
backtracking(n, k, 1, [], results);
return results;
};
const backtracking = (n, k, start, solution, results) => {
if (solution.length === k) {
return results.push(solution.slice());
}
for (let i = start; i <= n; i++) {
solution.push(i);
backtracking(n, k, i + 1, solution, results);
solution.pop();
}
};