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

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