兔子问题----算法基础

/**
* 递归的算法
* @param mounth
* @return
*/
public static int address(int mounth) {
if (mounth == 1 || mounth ==2) {
return 1;
}else {
return address(mounth - 1) + address(mounth - 2);
}
}

/**
* 循环的算法
* @param mounth
* @return
*/
public static int reserve(int mounth) {

int[] num = new int[mounth+1];
num[0] = 0;
num[1] = 1;

int index = 2;
if (mounth>1) {
while (index < mounth+1) {
num[index] = num[index - 1] + num[index - 2];
index++;
}
}

return num[mounth];
}