思路
转载:矩形覆盖
代码(自下向上)(原算法复杂度比较高)
注意当taeget = 0的时候
public class Solution {
public int rectCover(int target) {
if ( target >=0 && target<= 2)
return target;
int a = 1, b =2,sum =a+b;
for(int i = 3;i<= target;i++){
sum= a+b;
a=b;
b= sum;
}
return sum;
}
}