题解 | #斐波那契数列#

使用自底向上的解法。

public class Solution {
    public int Fibonacci(int n) {
        if(n==0){return 0;}
        if(n==1 || n==2){return 1;}
        int prev = 1, curr = 1;
        for(int i = 3;i<= n;i++){
            int sum = prev + curr;
            prev = curr;
            curr = sum;
        }
        return curr;
    }
}