Java用递归求N!=N*(N-1)*(N-2)*...*2*1

package recursion;

public class Recursion {
	//第一种
	//初值设为1，当用户输入0或者1都返回1
	int number=1;
	public int recurs(int num) {
			//只要不等于0就继续
			if(num!=0) {
				number*=num;
			//递归
				recurs(num-1);
			}else {
				System.out.println(number);
			}
			return number;
	}//recurs
	
	//第二种
	//在if和else语句里都要返回，不然就会报错
	public int recurss(int num) {
		if(num==0||num==1) {
			return 1;
		}else {
			 return num*recurss(num-1);
		}
	}//recurss
}

package recursion;
import java.util.Scanner;

public class Test {
	
	public static void main(String []args) {
		
		Scanner input=new Scanner(System.in);
		Recursion rc=new Recursion();
		System.out.println("请输入：");
		//第一种
		rc.recurs(input.nextInt());
		//第二种
		System.out.println(rc.recurss(input.nextInt()));
	}
}