不同的二叉树和[动态规划]

function name(k) {
  let arr = new Array(k + 1).fill(0)
  arr[0] = 1
  arr[1] = 1
  for (let j = 2; j <= k; j++) {
    for (let i = 1; i <= j; i++) {
      arr[j] += arr[i - 1] * arr[j - i]
    }
  }
  return arr
}
console.log(name(9));