freeCodeCamp/curriculum/challenges/russian/08-coding-interview-prep/rosetta-code/combinations.russian.md

title, id, challengeType, forumTopicId, localeTitle

title	id	challengeType	forumTopicId	localeTitle
Combinations	5958469238c0d8d2632f46db	5	302233	Комбинации

Description

Задача:

Учитывая неотрицательные целые числа m и n , генерируйте все размерные m комбинаций целых чисел от 0 (ноль) до n-1 в отсортированном порядке (каждая комбинация сортируется и вся таблица сортируется).

Пример:

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

tests:
  - text: <code>combinations</code> is a function.
    testString: assert(typeof combinations === 'function');
  - text: <code>combinations(3, 5)</code> should return <code>[[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]]</code>.
    testString: assert.deepEqual(combinations(testInput1[0], testInput1[1]), testOutput1);
  - text: <code>combinations(4, 6)</code> should return <code>[[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]]</code>
    testString: assert.deepEqual(combinations(testInput2[0], testInput2[1]), testOutput2);

Challenge Seed

function combinations(m, n) {
  // Good luck!
  return true;
}

After Tests

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]];

Solution

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));
}