public class recursion {
public static void main(String[] args) {
System.out.println(fibonacci(10));
System.out.println(increase(10));
System.out.println(multiplication(10));
}
/**
* 斐波那契数列
* @param num
* @return
*/
public static int fibonacci(int num) {
if (num==1){
return 1;
}
if (num==2){
return 1;
}
return fibonacci(num-1)+fibonacci(num-2);
}
/**
* 1+2+3+4+5...+n
* @param num
* @return
*/
public static int increase(int num) {
if (num==1){
return 1;
}
return num + increase(num-1);
}
/**
* 1*2*3*4*5...*n
* @param num
* @return
*/
public static int multiplication(int num) {
if (num==1){
return 1;
}
return num * multiplication(num-1);
}
}
递归实现:斐波那契数列;1+2+3+4+5...+n;1*2*3*4*5...+n
最新推荐文章于 2023-04-06 07:00:00 发布