【笔记】斐波那契数列解法

#include<stdio.h>
int main(){
	int fibonacci(int i), sum = 0;
	for (int i = 0; fibonacci(i) < 4000000; i++){
		if(fibonacci(i)%2==0){
			sum += fibonacci(i);
		}
	}
	printf("%d\n", sum);
	return 0;
}

int fibonacci(int n) {
    if(n < 2){
        return n;
    }
    int p = 0, q = 1, r = 1;
    for(int i = 2; i < n; i++){
        p = q;
        q = r;
        r = p + q;
    }
    return r;
}

题目来源：https://pe-cn.github.io/2/
思路来源：https://leetcode-cn.com/problems/fibonacci-number/solution/fei-bo-na-qi-shu-by-leetcode-solution-o4ze/