-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathcombinations.js
More file actions
54 lines (52 loc) · 775 Bytes
/
Copy pathcombinations.js
File metadata and controls
54 lines (52 loc) · 775 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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/**
* Source: https://leetcode.com/problems/combinations/
* Tags: [Backtracking]
* Level: Medium
* Title: Combinations
* Auther: @imcoddy
* Content: 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],
* ]
*
*
*
* Subscribe to see which companies asked this question
*
*
*
*
*
*
*
*
*
*
*
*
* Show Similar Problems
*
*
* (M) Combination Sum
*
* (M) Permutations
*/
/**
* @param {number} n
* @param {number} k
* @return {number[][]}
*/
var combine = function(n, k) {
};