class Solution {
public:
//(a + b) % c = (a % c + b % c) % c;
//时间O(n), 空间O(1)
int numWays(int n) {
if(n == 0) return 1;
if(n <= 3) return n;
int s1 = 1;
int s2 = 2;
int sum = s1 + s2;
for(int i = 3; i <= n; i++) {
sum = (s1 + s2) % 1000000007;
s1 = s2;
s2 = sum;
}
return sum;
}
};
剑指 Offer 10- II. 青蛙跳台阶问题
最新推荐文章于 2023-01-19 19:16:16 发布