力扣-剑指 Offer 10-II. 青蛙跳台阶问题(C++)- 动态dp
题目链接:https://leetcode-cn.com/problems/qing-wa-tiao-tai-jie-wen-ti-lcof/题目如下:class Solution {public: int numWays(int n) { if(n==0) return 1; if(n==1) return 1; #define MOD 1000000007 int dp[n+1]; dp[0