斐波那契数列

大家都知道斐波那契数列，现在要求输入一个整数n，请你输出斐波那契数列的第n项。  n<=39

public class Solution {
    public int Fibonacci(int n) {
        if(n == 0) return 0;
        if(n == 1) return 1;
        int l = 0, r = 1, m = 0;
        for(int i=2; i<=n; ++i) {
            m = l;
            l = r;
            r = m + r;
        }
        return r;
    }
}