```java
// java不使用递归方式求1 ~ N的阶乘!publicclassRecursion{publicstaticvoidmain(String[] args){int n =5;int retresult =factorial(n);
System.out.println(retresult);}publicstaticintfactorial(int n){int result =1;for(int i = n; i >0; i--){
result *= i;}return result;}}
// java递归方式求1 ~ N的阶乘:publicclassRecursion{publicstaticvoidmain(String[] args){int n =5;int retresult =factorial(n);
System.out.println(retresult);}publicstaticintfactorial(int n){if(n ==1){return1;}return n *factorial(n -1);}}
public class Recursion{ public static void main(String[] args){ int n = 4; int retValue = sum(n); System.out.println(retValue); } public static int sum(int n){ if (n == 1) { return 1; } return n + sum(n - 1); }}