JZ7 斐波那契数列

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