❓Что будет на выходе?

function recursivePascalTriangle(n, row = [1], triangle = []) {
  triangle.push(row);
  if (n === triangle.length) {
    return triangle;
  }
  const nextRow = [1];
  for (let i = 1; i < row.length; i++) {
    nextRow.push(row[i] + row[i - 1]);
  }
  nextRow.push(1);
  return recursivePascalTriangle(n, nextRow, triangle);
}

const result = recursivePascalTriangle(5);

console.log(result);

Ответ: [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1], [1, 4, 6, 4, 1]]

JavaScript test | #JavaScript & Max