classSolution{publicintnumWays(int n){if(n ==0)return1;if(n ==1)return1;if(n ==2)return2;int x =1;int y =2;int tmp =0;for(int i =0; i < n -2; i++){
tmp = x;
x = y %1000000007;
y =(tmp + y)%1000000007;}return y;}}
完全就是斐波那契数列问题,变种而已class Solution { public int numWays(int n) { if (n == 0) return 1; if (n == 1) return 1; if (n == 2) return 2; int x = 1; int y = 2; ...