public class Solution {
public int numWays(int n) {
if (n<= 1) {
return 1;
}
if (n == 2) {
return 2;
}
int a = 1;
int b = 2;
int temp = 0;
for (int i = 3; i <= n; i++) {
temp = (a + b)% 1000000007;//防止整数溢出 同时取余数
a = b;
b = temp;
}
return temp;
}
}
动态规划笔记
最新推荐文章于 2024-10-14 17:16:49 发布