您正在传递没有起始条件的乘数。下面的代码可以解决您的问题：

recursionTable = (multiplier, num) => {

    if (num === 10) {
        return "We've hit the end, my friends."
    }
    else {
      console.log(num * multiplier);
    }
    return recursionTable(multiplier, num + 1);
}

let num = 1;
console.log(recursionTable(10, num));

你的代码的问题是你在每次递归时都设置num = 1，为了防止这种情况，你应该像这样重构你的代码：

recursionTable = (multiplier) => {
  if (num === 10) {
    return "We've hit the end, my friends."
  }

  num += 1;
  return num * recursionTable(multiplier);
}

let num = 1;

或者发送2个值作为函数中的参数

recursionTable = (multiplier, initValue) => {}

并将内部num值替换为initValue

谢谢大家的帮助！我开始掌握它的窍门了。结果就像你们中的一些人指出的那样，我甚至没有包括递归的公式来做任何事情。现在它工作了，我已经读了一遍，它真的开始有意义了。再次感谢！
代码我最终使用：

recursionTable = (num, multi) => {
  if (num === 11) {
    return "We've hit the end of the recursion table.";
  } else {
    console.log(`${num} x ${multi} = ${num * multi}`);
  }
  return recursionTable(num + 1, multi);
};

let num = 1;
console.log(recursionTable(num, 10));

/*
1 x 10 = 10
2 x 10 = 20
3 x 10 = 30
4 x 10 = 40
5 x 10 = 50
6 x 10 = 60
7 x 10 = 70
8 x 10 = 80
9 x 10 = 90
10 x 10 = 100
We've hit the end of the recursion table 
*/

试试这个：

function recursionTable(multiplier, num) {
  

  if (num === 10) {
    return "We've hit the end, my friends.";
  }

  console.log(`${num} x ${multiplier} = ${num * multiplier}`);

  return recursionTable(multiplier, num + 1);
}

let num = 1;
console.log(recursionTable(10, num));