题解 | #斐波那契数列#

递归加非递归

public class Solution {
    public int Fibonacci(int n) {
         int first = 1;
        int second = 1;
        int third = 1;
        int cur = 3;
        while (cur++ <= n) {
            third = first + second;
            first = second;
            second = third;
        }
        return third;
    }
    
    public int fib0(int n) {
        if (n < 3) {
            return 1;
        }
        return Fibonacci(n - 1) + Fibonacci(n - 2);
    }
    
    
}