递归1
矩形覆盖
http://www.nowcoder.com/questionTerminal/72a5a919508a4251859fb2cfb987a0e6
斐波那契
public int RectCover(int target) {
//n=1,1
//n=2,2
//n=3,3
//n=4,5
if(target<=3){
return target;
}else{
return RectCover(target-1)+RectCover(target-2);
}
}
查看7道真题和解析
