class Solution {
public:
int numWays(int n) {
int a[2]={1,1};
if(n<2)
{
return a[n];
}
long long fibone=1;
long long fibtwo=1;
long long fib=0;
for(unsigned int i=2;i<=n;i++)
{
fib=fibone+fibtwo;
fibtwo=fibone%1000000007;
fibone=fib%1000000007;
}
return fib%1000000007;
}
};
青蛙跳台阶问题本质上是斐波那契问题,但是有一点小不同class Solution {public: int numWays(int n) { int a[2]={1,1}; if(n<2) { return a[n]; } long long fibone=1; long long fibtwo=1; long long fib=0;