-
Notifications
You must be signed in to change notification settings - Fork 0
/
Problem2.java
58 lines (47 loc) · 1.25 KB
/
Problem2.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
package com.javamultiplex.projecteuler;
import java.util.ArrayList;
import java.util.List;
/**
*
* @author Rohit Agarwal
* @category Project Euler Problems
* @Problems 2 - Even Fibonacci numbers
*
*/
public class Problem2 {
public static void main(String[] args) {
int limit = 4000000; // 4 million
long result = getSumOfEvenFibonacciSequence(limit);
System.out.println("The sum of even valued terms of fibonacci sequence "
+ "whose values do not exceed four million is : " + result);
}
private static long getSumOfEvenFibonacciSequence(int limit) {
List<Integer> fib = new ArrayList<Integer>();
/*
* Default values of first two terms of fibonacci sequence is 1,1.
*/
fib.add(0, 1);
fib.add(1, 1);
int i = 1, temp, evenSum = 0;
while (fib.get(i) <= limit) {
i++;
temp = getNextFibonacciTerm(fib, i);
fib.add(i, temp);
temp = fib.get(i);
if (temp <= limit) {
if (temp % 2 == 0) {
evenSum += temp;
}
}
}
return evenSum;
}
private static int getNextFibonacciTerm(List<Integer> fib, int i) {
/*
* On adding previous 2 terms we can get next fibonacci term.
*
*/
int result = fib.get(i - 1) + fib.get(i - 2);
return result;
}
}