zoukankan      html  css  js  c++  java
  • Java递归算法——阶乘

    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStream;
    import java.io.InputStreamReader;
    
    //=================================================
    // File Name       :	Factorial_demo
    //------------------------------------------------------------------------------
    // Author          :	Common
    
    //类名:
    //属性:
    //方法:
    
    
    //主类
    //Function        : 	triangle_demo
    public class Factorial_demo {
    
    	public static void main(String[] args) throws Exception{
    		// TODO 自动生成的方法存根
    		System.out.println("输入数字:");
    		int theNumber = getInt();
    		int theAnswer = factorial(theNumber); 
    		System.out.println("阶乘:"+theAnswer);
    	}
    	
    	public static int factorial(int n){		//递归
    		if(n == 1)
    			return 1;
    		else
    			return (n*factorial(n-1));
    	}
    	
    	//输出方法
    		public static String getString() throws IOException{
    			InputStreamReader isr = new InputStreamReader(System.in);
    			BufferedReader br = new BufferedReader(isr);
    			String s = br.readLine();
    			return s;
    		}
    		
    		//输出方法
    		public static int getInt() throws IOException{
    			String s = getString();
    			return Integer.parseInt(s);
    			
    		}
    
    }
    
  • 相关阅读:
    安装django(使用国内镜像)
    adb工具安装与配置
    mysql
    Charles抓包(iOS的http/https请求)
    selenium+python第一个自动化脚本
    selenium+python环境搭建
    python,你好!
    tjkd-html
    asp
    uglifyjs压缩批处理
  • 原文地址:https://www.cnblogs.com/tonglin0325/p/5359200.html
Copyright © 2011-2022 走看看