[백준 알고리즘] 10872번 팩토리얼 자바

---

import java.util.Scanner;
 
public class Main {
	static int result = 1;
	public static void main(String[] args) {
 
		Scanner in = new Scanner(System.in);
		
		int N = in.nextInt();
		in.close();
		
		int sum = factorial(N);
		System.out.println(sum);
		
	}
	
	public static int factorial(int N) {
		if(N <= 1) return result;	// 재귀 종료조건
		result *= N;
		return factorial(N - 1);		
	}
 
}

---