如何实现及修复递归函数，使其返回从0到指定数值的数组？

Hey there! Let's work through your two recursion questions step by step—first covering the core approach, then fixing your existing code.

1. How to Write a Recursive Function for a 0-to-n Array #

To build this function, you need to nail the two foundational parts of any recursive solution:

• Base Case: The point where the recursion stops. For this problem, when n is 0, we can directly return [0]—that's our smallest valid array.
• Recursive Step: Break the problem into a smaller version of itself. For a given n, first get the array of numbers from 0 to n-1 using the same function, then add n to the end of that array.

Here's a straightforward implementation following this logic:

function rangeUp(n) {
  // Handle negative input first
  if (n < 0) {
    console.error("The number is invalid.");
    return []; // Return empty array for consistent return type
  }
  // Base case: return [0] when n is 0
  if (n === 0) {
    return [0];
  }
  // Recursive step: get the smaller array, then append n
  const smallerRange = rangeUp(n - 1);
  smallerRange.push(n);
  return smallerRange;
}

2. Fixing Your Existing Code #

Let's diagnose why your current code always returns 1:

Your original code:

function rangeUp(n, numberList = []) {
  if (n < 0) return console.error("The number is invalid.");
  if (n == 0) return numberList.push(n);
  return rangeUp(--n, numberList);
}

The critical mistake here is that Array.push() returns the new length of the array, not the array itself. When n hits 0, you're returning 1 (since pushing 0 to an empty array gives a length of 1), and every recursive call above that just passes this number back instead of the actual array.

Here's the fixed version, with notes on the changes:

function rangeUp(n, numberList = []) {
  // Handle invalid input: log error and return the array (consistent return type)
  if (n < 0) {
    console.error("The number is invalid.");
    return numberList;
  }
  // Base case: add 0 to the array, then return the array itself
  if (n === 0) {
    numberList.push(n);
    return numberList;
  }
  // Recursive step: first process n-1, then add n to the array
  // This ensures we build the array from 0 up to n
  numberList = rangeUp(n - 1, numberList);
  numberList.push(n);
  return numberList;

  // If you prefer using --n instead of n-1, you can adjust like this:
  // rangeUp(--n, numberList);
  // numberList.push(n + 1);
  // return numberList;
}

Testing this fixed function:

• rangeUp(5) will correctly return [0, 1, 2, 3, 4, 5]
• rangeUp(0) returns [0]
• rangeUp(-3) logs the error and returns []

A quick note on the numberList default parameter: this is a handy pattern for recursive functions that build a result incrementally—it initializes the array once when the function is first called, so you don't have to pass it manually.

内容的提问来源于stack exchange，提问作者Emmanuel CG