剑指 Offer 10- II. 青蛙跳台阶问题

这个的思路和斐波那契数列那题差不多，直接递推…

class Solution {
    public int numWays(int n) {
        int []f = new int[101];
        f[0] = 1;
        f[1] = 1;
        for(int i = 2; i <= n; i++){
            f[i] = f[i-1] % 1000000007 + f[i-2] % 1000000007;
        }
        return f[n] % 1000000007;
    }
}

LeetCode题解

class Solution {
    public int numWays(int n) {
        int a = 1, b = 1, sum;
        for(int i = 0; i < n; i++){
            sum = (a + b) % 1000000007;
            a = b;
            b = sum;
        }
        return a;
    }
}