const sum = (numbers) => {
const fn = (i) => {
return i >= numbers.length ? 0 : numbers[i] + fn(i + 1)
}
return fn(0)
}
数组递归求和
最新推荐文章于 2024-05-04 03:45:26 发布
const sum = (numbers) => {
const fn = (i) => {
return i >= numbers.length ? 0 : numbers[i] + fn(i + 1)
}
return fn(0)
}