剑指 Offer 10- II. 青蛙跳台阶问题
思路:简单的dp问题。第i个位置从i-1的位置和i-2的位置转移而来
f
[
i
]
=
f
[
i
−
1
]
+
f
[
i
−
2
]
f[i] = f[i-1] + f[i-2]
f[i]=f[i−1]+f[i−2]
class Solution {
public int numWays(int n) {
int[] f = new int[n+1];
f[0] = 1;
if(n < 1) return f[0];
f[1] = 1;
for(int i = 2 ; i <= n ; i++){
f[i] = (f[i-1]+f[i-2])% 1000000007;
}
return f[n] ;
}
}