factorial2.java

来自「算法设计与分析 1. 用直接递归方法计算n！： （2」· Java 代码 · 共 36 行

/**
 * @(#)Factorial2.java
 *
 *
 * @author 
 * @version 1.00 2008/10/21
 */
import java.util.Scanner;
public class Factorial2 {
        
    /**
     * Creates a new instance of <code>Factorial2</code>.
     */
   public static int  Factorial2(int n )
        {
        	if(n==0)return 1;
        	return n+Factorial2(n-1);
        	
        }
    
    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        int n=0;
        
        Scanner scan = new Scanner(System.in);
        System.out.print("input n=");
        
        n = scan.nextInt();     
        
        System.out.println("Factorial2("+n+")="+Factorial2(n));
    }
}