本题用时7分钟,主要的时间用来解决取模的问题。
题目链接
https://leetcode-cn.com/problems/three-steps-problem-lcci/
解题思路
- 动态规划;
- dp[i]代表走到i层台阶的方法的数量;
- dp[i] = dp[i-1] + dp[i-2] + dp[i-3];
代码
class Solution {
public:
int waysToStep(int n) {
if(n <= 2)
return n;
vector<long> dp(n+1, 0);
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
dp[3] = 4;
if(n)
for(int i = 4; i < n+1; ++i)
{
dp[i] = dp[i-1]+dp[i-2]+dp[i-3];
dp[i] = dp[i] % 1000000007;
}
return dp[n] % 1000000007;
}
};