package testUtil;
import java.util.Scanner;
public class Recursive {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
System.out.println("请输入想要计算的数字:");
int ss = s.nextInt();
System.out.println("结果:"+getNumb(ss));
System.out.println("结果:"+getNumb1(ss));
}
//递归求和1+2+3+.....+n
public static int getNumb(int n ){
if(n>0){
return n+getNumb(n-1);
}else
return n;
}
//递归计算阶乘
public static int getNumb1(int n){
if(n>1){
return n*getNumb1(n-1);
}else
return n;
}
}
import java.util.Scanner;
public class Recursive {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
System.out.println("请输入想要计算的数字:");
int ss = s.nextInt();
System.out.println("结果:"+getNumb(ss));
System.out.println("结果:"+getNumb1(ss));
}
//递归求和1+2+3+.....+n
public static int getNumb(int n ){
if(n>0){
return n+getNumb(n-1);
}else
return n;
}
//递归计算阶乘
public static int getNumb1(int n){
if(n>1){
return n*getNumb1(n-1);
}else
return n;
}
}