--- title: Combinations id: 5958469238c0d8d2632f46db challengeType: 5 videoUrl: '' localeTitle: 组合 --- ## Description
任务：

给定非负整数m和n ，以排序顺序生成从0 （零）到n-1的整数的所有大小m个 组合 （每个组合被排序并且整个表被排序）。

例：

3梳子5是： 

 0 1 2
0 1 3
0 1 4
0 2 3
0 2 4
0 3 4
1 2 3
1 2 4
1 3 4
2 3 4
## Instructions
## Tests
```yml tests: - text: combinations是一种功能。 testString: 'assert(typeof combinations === "function", "combinations is a function.");' - text: 'combinations(3, 5)应返回[[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]] 。' testString: 'assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1, "combinations(3, 5) should return [[0, 1, 2], [0, 1, 3], [0, 1, 4], [0, 2, 3], [0, 2, 4], [0, 3, 4], [1, 2, 3], [1, 2, 4], [1, 3, 4], [2, 3, 4]].");' - text: 'combinations(4, 6)应返回[[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]' testString: 'assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2, "combinations(4, 6) should return [[0,1,2,3], [0,1,2,4], [0,1,2,5], [0,1,3,4], [0,1,3,5], [0,1,4,5], [0,2,3,4], [0,2,3,5], [0,2,4,5], [0,3,4,5], [1,2,3,4], [1,2,3,5], [1,2,4,5], [1,3,4,5], [2,3,4,5]]");' ```
## Challenge Seed
```js function combinations (m, n) { // Good luck! return true; } ```
### After Test
```js console.info('after the test'); ```
## Solution
```js // solution required ```