js//输入斐波那契数列的项数num,求前num项的和 //示例:输入5,输出结果“斐波那契数列的前5项之和为12”
时间: 2024-01-25 15:02:46 浏览: 15
let num = parseInt(prompt("请输入斐波那契数列的项数:"));
let sum = 0;
let a = 1, b = 1;
for (let i = 1; i <= num; i++) {
sum += a;
let temp = a + b;
a = b;
b = temp;
}
console.log("斐波那契数列的前" + num + "项之和为" + sum);
相关问题
//输入斐波那契数列的项数num,求前num项的和 //示例:输入5,输出结果“斐波那契数列的前5项之和为12”
#include <iostream>
using namespace std;
int main() {
int num;
cout << "请输入斐波那契数列的项数num:";
cin >> num;
int sum = 0, a = 1, b = 1;
for (int i = 1; i <= num; i++) {
sum += a;
int temp = a + b;
a = b;
b = temp;
}
cout << "斐波那契数列的前" << num << "项之和为" << sum << endl;
return 0;
}
js使用递归方法//输入斐波那契数列的项数num,求前num项的和 //示例:输入5,输出结果“斐波那契数列的前5项之和为12”
function fibonacci(num) {
if (num <= 1) {
return num;
} else {
return fibonacci(num - 1) + fibonacci(num - 2);
}
}
function fibonacciSum(num) {
let sum = 0;
for (let i = 0; i < num; i++) {
sum += fibonacci(i);
}
return sum;
}
const num = 5;
const sum = fibonacciSum(num);
console.log(`斐波那契数列的前${num}项之和为${sum}`); // 输出:斐波那契数列的前5项之和为12
相关推荐
![c](https://img-home.csdnimg.cn/images/20210720083646.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![c](https://img-home.csdnimg.cn/images/20210720083646.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)