题解 | #矩形覆盖#
矩形覆盖
http://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6
public static int rectCover(int target) {
if(target==0)return 0;
int a = 1, b=1;
for (int i = 1; i < target; i++) {
a = a + b;
b = a - b;
}
return a;
}
投递腾讯等公司10个岗位