java题目：利用递归方法求n!。 1程序分析：递归公式：fn=fn_14!

public class Factorial { public static int factorial(int n) { if (n == 0 || n == 1) { return 1; // base case } else { return n * factorial(n-1); // recursive case } }

public static void main(String[] args) { int n = 5; int result = factorial(n); System.out.println(n + "! = " + result); } }