题解 | 斐波那契数列

import java.util.*;


public class Solution {
    int[] arr = new int[50];

    public int Fibonacci(int n) {
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return 1;
        }
        arr[0] = 0;
        arr[1] = 1;
        arr[2] = 1;
        for (int i = 2; i <= n; i++) {
            arr[i] = arr[i - 1] + arr[i - 2];
        }
        return arr[n];
    }
}