Java 使用递归求任意数!(的阶乘)

代码

package xyz.recursionFactorial;

import java.util.Scanner;

public class index {
    public static void main(String[] args) {
        System.out.println("please input a number(int),computing tha value of the recursion.\n");
        Scanner sc = new Scanner(System.in );
        int number = 0;
        if(sc.hasNextInt()){
            number = sc.nextInt();
        }
        System.out.println("the value is :"+recursion(number));
        sc.close();
    }
    public static int recursion(int number){
        if (number == 1){
            return 1;
        }
        else if(number ==0){
            return  0;
        }
        else if(number > 0){
            return number*recursion(number - 1);
        }
        else {
            System.out.println("the number you input is wrong.");
            return 0;
        }
    }

}