题解 | #矩形覆盖#
矩形覆盖
https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&&tqId=11163&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
本质上还是斐波那契数组
public class Solution {
public int rectCover(int n) {
if (n <= 2) return n;
int a1 = 1;
int a2 = 2;
int ret = 0;
for (int i = 3; i <= n; i++) {
ret = a1 + a2;
a1 = a2;
a2 = ret;
}
return ret;
}
} 
学而思开奖50人在聊