Problem2 偶斐波那契数列
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
斐波那契数列中的每个新项都是通过将前两项相加而生成的。从 1 和 2 开始,前 10 项将是:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, …
通过考虑 Fibonacci 数列中值不超过 400 万的项,找出偶数项的总和。
方法一
#include<iostream>
using namespace std;
int num[4000005], ans; //数组多加5,避免数组越界 ;全局变量自动清零,不用初始化
int main(){
num[0] = 1, num[1] = 2, ans = 2;
for(int i = 2; 1; i++){
num[i] = num[i-1] + num[i-2];
if(num[i] > 4000000){
break;
}else if(num[i] % 2 == 0){
ans += num[i];
}
}
cout << ans << endl;
return 0;
}
方法二
#include<iostream>
using namespace std;
int main(){
int a = 1, b = 2, ans = 0;
while(b < 4000000){
if(b % 2 == 0){
ans += b;
}
b += a;
a = b - a;
}
cout << ans << endl;
return 0;
}
拓展:空间复杂度
在数据大小扩大一倍时,算法使用的额外内存是如何扩大的?