递归 求n！java实现

递归 求n！java实现

package Digui1zijibiande;
//递归 求n！
import java.util.Scanner;

public class S1 {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		System.out.println(Factorial(n));
	}

	private static int Factorial(int n) {
		if(n==0)
			return 1;
		else
			return n*Factorial(n-1);
		
	}

}