剑指offer——矩形覆盖

题目

思路

c++实现

class Solution {
public:
int rectCover(int number) {
int result;
if(number == 0){
return 0;
}
if(number == 1){
return 1;
}
if(number == 2){
return 2;
}
if(number > 2){
result = rectCover(number-1) + rectCover(number-2);
}
return result;
}
};