兔子问题、递归
public class Test {
/**
* 兔子问题
* 斐波那契数列
*/
@org.junit.Test
public void test2() {
int m = 5;
for (int i = 1; i <= m; i++) {
System.out.printf("第%d个月,有%d个兔子\n", i, fib(i));
}
}
private int fib(int month) {
if (month == 1 | month == 2) {
return 1;
} else {
return fib(month - 1) + fib(month - 2);
}
}
/**
* 计算1+2+3+4+...+100的值
*/
@org.junit.Test
public void test3() {
int i = 10;
System.out.printf("%d的累计和是%d", i, sum(i));
}
private int sum(int x) {
if (x == 1) {
return 1;
} else {
return x + sum(x - 1);
}
}
/**
* 计算1 -2 +3 +-4+ 5- 6 + 7 - 8 + 9的值
*/
@org.junit.Test
public void test4() {
int i = 4;
System.out.printf("%d的差累计和是%d", i, sum2(i));
}
private int sum2(int i) {
if (i == 1) {
return 1;
}
else if (i % 2 == 0) {
return sum2(i - 1) - i;
} else {
return sum2(i - 1) + i;
}
}
/**
* 汉诺塔问题
* 实现 A-B-C 方式,A-C-B, A-C, B-A-C
*/
@org.junit.Test
public void test5() {
}
}