package com.uncle.array_test;
/**
* 经典快排算法之阶乘的递归和非递归
*
*/
//阶乘
public class TestFactorial {
//循环方法
public int factorial(int number) {
int result = 1;
for (int i = 1; i <= number; i++) {
result *= i;
}
return result;
}
//阶乘方法
public int factorial1(int num) {
//简单的阶乘思想
//前面有关于阶乘思想的讲解
if (num == 1) {
return 1;
}
return num * this.factorial1(num - 1);
}
public static void main(String[] args) {
TestFactorial testFactorial = new TestFactorial();
System.out.println(testFactorial.factorial(5));//120
System.out.println(testFactorial.factorial1(5));//120
}
}
经典快排算法之阶乘的递归和非递归
最新推荐文章于 2024-07-23 08:00:00 发布