题解 | 斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
import java.util.*; public class Solution { int[] arr = new int[50]; public int Fibonacci(int n) { if (n == 1 || n == 2) { return 1; } arr[n - 1] = Fibonacci(n - 1); arr[n - 2] = Fibonacci(n - 2); return arr[n - 1] + arr[n - 2]; } }