:递归
package com.atguigu.recursion;
public class RecursionDemo {
public static void main(String[] args) {
// TODO Auto-generated method stub
test(4);
}
public static void test(int n) {
if(n>2) {
test(n-1);
}
System.out.println("n="+n);
}
}
package com.atguigu.recursion;
import java.util.Scanner;
public class RecursionDemo {
public static void main(String[] args) {
// TODO Auto-generated method stub
// test(4);
Scanner sc = new Scanner(System.in);
System.out.println("输入一个整数");
int n = sc.nextInt();
int result = factorial(n);
System.out.println("result= "+result);
}
//打印问题
public static void test(int n) {
if(n>2) {
test(n-1);
}
System.out.println("n="+n);
}
//阶乘问题
public static int factorial(int n) {
if(n==1) {
return 1;
}else {
return factorial(n-1)*n;
}
}
}