Java递归求n的阶乘

 

package com.study;
import java.util.Scanner;
public class CountDi {
    public static int factorial(int n){
        int sum=1;
       for (int y=1;y<=n;y++) {
           if (n==0){
               sum=1;
           }
           else
               sum = y * sum;
       }
        return sum;
    }
    public static void main(String[] args)
    {
        System.out.println("请输入数字n：");
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int sum=1;
        String s="!=";
        for (int x=1;x<=n;x++) {
            if (x<n){
                s = s + x+ '*' ;
            }
            else{
                s = s  + x + "=" ;
            }
        }
        System.out.println(n+s+factorial(n));
    }
}