剑指 Offer 10- I. 斐波那契数列

自己的解法：动态规划

可以说是非常简单也非常经典的动规题，入门级别

class Solution {
    public int fib(int n) {
        if(n<=1) return n;
        if(n == 2) return 1;
        int pre = 1;//1
        int cur = 1;//2
        for (int i = 3; i <= n; i++) {
            int now = cur + pre;
            pre = cur%1000000007;
            cur = now%1000000007;
        }
        return cur;
    }
}