打印杨辉三角的前 n 行

[nmsn]

No description provided.

[nmsn]

function printYangHuiTriangle(n) {
  let triangle = [];
  for (let i = 0; i < n; i++) {
    triangle[i] = [];
    for (let j = 0; j <= i; j++) {
      if (j === 0 || j === i) {
        triangle[i][j] = 1;
      } else {
        triangle[i][j] = triangle[i - 1][j - 1] + triangle[i - 1][j];
      }
    }
    console.log(triangle[i].join(" "));
  }
}