如何在不重复行或列的情况下找到n个5长数组的每个组合

function findCombinations(n) {
  const result = [];
  backtrack([], Array.from({ length: n }, (_, i) => i + 1), 0, 5);
  return result;

  function backtrack(combination, candidates, start, count) {
    if (combination.length === count) {
      result.push(combination.slice());
      return;
    }

    for (let i = start; i < candidates.length; i++) {
      combination.push(candidates[i]);
      backtrack(combination, candidates.slice(i + 1), start + 1, count);
      combination.pop();
    }
  }
}

const combinations = findCombinations(5);
console.log(combinations);