用三种方法来实现n!实现使用BigDecimal类,因为用int最多正确算到12!,用long最多正确算到20!.实现方法都比较简单,但是转换为BigDecimal实现后可能看起来有点莫名其妙。废话不多说,直接上代码:
第一种方法:从1开始,一直递增乘到n,从而实现n!
- <span>package Factorial;
- import java.math.BigDecimal;
- import java.util.Scanner;
- public class Factorial1 {
- public static BigDecimal factorial(int n){
- BigDecimal result = new BigDecimal(1);
- BigDecimal a;
- for(int i = 2; i <= n; i++){
- a = new BigDecimal(i);//将i转换为BigDecimal类型
- result = result.multiply(a);//不用result*a,因为BigDecimal类型没有定义*操作</span><span>
- }
- return result;
- }
- public static void main(String[] arguments){
- Scanner sc = new Scanner(System.in);
- int a = sc.nextInt();//读取控制台输入的整数
- System.out.println(a + "!=" + factorial(a));
- }
- }
- </span>
第二种方法:从n开始,一直递减乘到2,从而实现n!
- <span>package Factorial;
- import java.math.BigDecimal;
- import java.util.Scanner;
- public class Factorial3 {
- public static BigDecimal factorial(BigDecimal n){
- BigDecimal bd1 = new BigDecimal(1);//BigDecimal类型的1
- BigDecimal bd2 = new BigDecimal(2);//BigDecimal类型的2</span><span>
- BigDecimal result = bd1;//结果集,初值取1
- while(n.compareTo(bd1) > 0){//参数大于1,进入循环
- result = result.multiply(n.multiply(n.subtract(bd1)));//实现result*(n*(n-1))
- n = n.subtract(bd2);//n-2后继续
- }
- return result;
- }
- public static void main(String[] arguments){
- Scanner sc = new Scanner(System.in);
- BigDecimal n = sc.nextBigDecimal();
- System.out.print(n + "!=" + factorial(n));
- }
- }
- </span>
第三种方法,用递归实现:f(n)=n*f(n-1),f(1)=1,递归相乘,从而实现n!
- package Factorial;
- import java.util.Scanner;
- import java.math.BigDecimal;
- public class Factorial2 {
- public static BigDecimal factorial(BigDecimal n){
- BigDecimal bd1 = new BigDecimal(1);//1
- if(n.equals(new BigDecimal(1))){
- return bd1;
- }
- else
- return n.multiply(factorial(n.subtract(bd1)));//n*f(n-1)
- }
- public static void main(String[] arguments){
- Scanner sc = new Scanner(System.in);
- BigDecimal a = sc.nextBigDecimal();
- BigDecimal result = factorial(a);
- System.out.println(a + "!=" +result);
- }
- }