java - 欧拉计划 #2 无限？

Question

我正在尝试解决 Euler's Project #2我一直得到“无限”或“NaN”(不是数字)的答案 我尝试将数字类型更改为 int(最初是 Double)，但是没有解决任何问题只是给了我答案“-1833689714”

public class Pro {
    static int g = 1;
    static int n, f = 0;
    public static void main(String args[]) {
        for (int i = 0; i <= 4000000; i++) {
            f = f + g;
            g = f - g;
            if (f % 2 == 0) {
                n += f;
            }
        }
        System.out.println("Answer: " + n);
    }
}

问题是:

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.

Answer 1

您考虑的是斐波那契数列的前 4,000,000 项，而不是不超过 4,000,000 的前 x 项。