//斐波那契数列
class Solution {
public int fib(int n) {
int a = 0, b = 1, sum;
for(int i = 0; i < n; i++){
sum = (a + b) % 1000000007;
a = b;
b = sum;
}
return a;
}
}
//青蛙跳台阶
class Solution {
public int numWays(int n) {
int a=1;
int b=1;
int sum=0;
for(int i=0;i<n;i++){
sum = (a+b)%1000000007;
a=b;
b=sum;
}
return a;
}
}