0
const sequenceSum = (begin, end) => {
// BEGIN (write your solution here)
if (begin === end) {
return end;
} else if (begin > end) {
return NaN;
}
return end + sequenceSum(end-1);
// END
};
export default sequenceSum;
你好。我不明白上述代码的问题。我有以下错误:递归JavaScript问题
RangeError: Maximum call stack size exceeded
看起来像递归永不止步。你究竟如何称呼这个函数? – str
http://xyproblem.info/ –