package test10;
import org.junit.Test;
/**
* @program: TestDemo
* @description: 写出一个递归算法。
* @author: xin yi
* @create: 2021-09-10 18:46
*/
public class Demo05 {
@Test
public void demo01(){
System.out.println("递归求1-100的和:\t" + digui01(100));
System.out.println("递归求10!:\t" + digui02(20L));
}
private Long digui02(Long m) {
if (m == 0){
return 0L;
}else if (m == 1){
return 1L;
}else {
return digui02(m-1) * m;
}
}
private int digui01(int n) {
if (n == 0){
return 0;
}else if (n == 1){
return 1;
}else {
return digui01(n-1) + n;
}
}
}