2021-06-15 07:49:18 +00:00
---
id: 5958469238c0d8d2632f46db
2021-08-02 14:05:44 +00:00
title: Combinações
2021-06-15 07:49:18 +00:00
challengeType: 5
forumTopicId: 302233
dashedName: combinations
---
# --description--
2021-08-02 14:05:44 +00:00
Dado os números inteiros não negativos `m` e `n` , gere todas as combinações de tamanho `m` dos inteiros de `0` (zero) a `n-1` em ordem (cada combinação é ordenada, assim como a tabela inteira).
2021-06-15 07:49:18 +00:00
2021-08-02 14:05:44 +00:00
**Exemplo:**
2021-06-15 07:49:18 +00:00
2021-08-02 14:05:44 +00:00
`3` comb `5` é:
2021-06-15 07:49:18 +00:00
< pre > 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
< / pre >
# --hints--
2021-08-02 14:05:44 +00:00
`combinations` deve ser uma função.
2021-06-15 07:49:18 +00:00
```js
assert(typeof combinations === 'function');
```
2021-08-02 14:05:44 +00:00
`combinations(3, 5)` deve retornar `[[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]]` .
2021-06-15 07:49:18 +00:00
```js
assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1);
```
2021-08-02 14:05:44 +00:00
`combinations(4, 6)` deve retornar `[[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]]`
2021-06-15 07:49:18 +00:00
```js
assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2);
```
# --seed--
## --after-user-code--
```js
const testInput1 = [3, 5];
const testOutput1 = [[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]];
const testInput2 = [4, 6];
const testOutput2 = [[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]];
```
## --seed-contents--
```js
function combinations(m, n) {
return true;
}
```
# --solutions--
```js
function combinations(m, n) {
const nArr = [...Array(n).keys()];
return (function generateCombinations (size, numArr) {
const ret = [];
for (let i = 0; i < numArr.length ; i + + ) {
if (size === 1) {
ret.push([numArr[i]]);
}
else {
const sub = generateCombinations(size - 1, numArr.slice(i + 1, numArr.length));
for (let subI = 0; subI < sub.length ; subI + + ) {
const next = sub[subI];
next.unshift(numArr[i]);
ret.push(next);
}
}
}
return ret;
}(m, nArr));
}
```