java递归30的阶乘_java 递归求阶乘

package helloclean.basetest;

import java.util.Scanner;

/**

* 递归求阶乘

*/

public class JCTest {

public static void main(String[] args) {

JCTest jcTest = new JCTest();

Scanner scanner = new Scanner(System.in);

while (true) {

System.out.println("please input a Integer number:");

String x = scanner.next();

if(x.equalsIgnoreCase("q")) {

System.out.println("quit!");

break;

}

int y = Integer.parseInt(x);

int res = jcTest.jcdg(y);

System.out.println("res = " + res);

}

}

public int jcdg(int n) {

System.out.println("Enter: " + n);

if(n == 0) {

System.out.println("return : 1");

return 1;

} else {

int temp = n * jcdg(n - 1);

System.out.println("return : " + temp);

return temp;

}

}

public int jc(int n) {

int res = 1;

while (n > 0) {

res = res * n;

--n;

}

return res;

}

}