gpt4 book ai didi

javascript - 理解列表的递归

转载 作者:行者123 更新时间:2023-11-30 16:21:48 25 4
gpt4 key购买 nike

我需要使用 2 个给定输入输出一系列数字的代码。但是,我不明白 我们如何推送list = range(start_num, end_num - 1) 时列出。数组仅在 if 语句中定义。它是如何工作的?

var range = function(start_num, end_num) 
{
if (end_num - start_num === 2)
{
return [start_num + 1];
}
else
{
var list = range(start_num, end_num - 1);
list.push(end_num - 1);
return list;
}
};

console.log(range(2,9));

最佳答案

也许它有助于逐步可视化它:

// Original function
function range(start_num, end_num) {
if (end_num - start_num === 2) {
return [start_num + 1];
} else {
var list = range(start_num, end_num - 1);
list.push(end_num - 1);
return list;
}
}

console.log(range(2, 9)); // [3, 4, 5, 6, 7, 8]

//---------------------------------------------
// Step by step

// step 1
function range(2, 9) {
if (7 === 2) { // false
return [3];
} else {
var list = range(2, 8); // result of step 2 which is [3, 4, 5, 6, 7]
list.push(8);
return list; // returns [3, 4, 5, 6, 7, 8]
}
}

// step 2
function range(2, 8) {
if (6 === 2) { // false
return [3];
} else {
var list = range(2, 7); // result of step 3 which is [3, 4, 5, 6]
list.push(7);
return list; // returns [3, 4, 5, 6, 7]
}
}

// step 3
function range(2, 7) {
if (5 === 2) { // false
return [3];
} else {
var list = range(2, 6); // result of step 4 which is [3, 4, 5]
list.push(6);
return list; // returns [3, 4, 5, 6]
}
}

// step 4
function range(2, 6) {
if (4 === 2) { // false
return [3];
} else {
var list = range(2, 5); // result of step 5 which is [3, 4]
list.push(5);
return list; // returns [3, 4, 5]
}
}

// step 5
function range(2, 5) {
if (3 === 2) { // false
return [3];
} else {
var list = range(2, 4); // result of step 6 which is [3]
list.push(4);
return list; // returns [3, 4]
}
}

// step 6
function range(2, 4) {
if (2 === 2) { // true
return [3]; // return [3]
} else {
// ...
}
}

堆栈看起来像这样:

step 1: I call range ↴
step 2: I call range ↴
step 3: I call range ↴
step 4: I call range ↴
step 5: I calls range ↴
↲ step 6: OK so I do not call range, return my value
↲ step 5 OK return step 6 result
↲ step 4 OK return step 5 result
↲ step 3 OK return step 4 result
↲ step 2 OK return step 3 result
↲ step 1 OK return step 2 result

关于javascript - 理解列表的递归,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/34626279/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com