class Solution {
public int numWays(int n) {
if (n == 0 || n == 1) {
return 1;
}
int[] dp = new int[n + 1];
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
}
return dp[n];
}
}
class Solution {
public int numWays(int n) {
int a = 1, b = 2;
for (int i = 1; i < n; i++) {
int sum = (a + b) % 1000000007;
a = b;
b = sum;
}
return a;
}
}