题解 | #斐波那契数列#

记录

import java.util.*;
class Solution {
    public int Fibonacci(int n) {
        if (n == 0 || n == 1){
            return n;
        }
        int one = 0,two = 1;
        int sum = 0;
        for (int i = 1; i < n; i++){
            sum = (one + two) % 1000000007;
            one = two;
            two = sum;
        }
        return sum;

    }
    public static void main(String[] args){
        Solution s = new Solution();
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int re = s.Fibonacci(n);
        System.out.println(re);
    }


}