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

题目

代码

#include <iostream>
#include <vector>
using namespace std; 

int numWays(int n) {
    
	if(n == 0 || n == 1){
    
		return 1;
	}
	vector<int> dp(n);
	dp[0] = 1;
	dp[1] = 2;
	for(int i = 2; i < n; i++){
    
		dp[i] = dp[i-1] + dp[i-2];
		dp[i] %= 1000000007;
	}
	return dp[n-1];
}

int main(){
    
	int n, res;
	cin>>n;
	res = numWays(n);
	cout<<res;
	return 0;
}