题解 | #斐波那契数列#递推思想 和跳台阶非常像

public class Solution {
    public int Fibonacci(int n) {
        //递推思想 f(n) = f(n-1) + f(n-2) f(0) = 0;f(1) = 1
        if(n == 0){
            return 0;
        }
        if(n == 1){
            return 1;
        }
        int a = 0;
        int b = 1;
        int res = 1;
        for(int i = 2;i<=n;i++){
            res = a + b;
            a = b;
            b = res;
        }
        return res;
    }
}