[HackerRank] Day 9: Recursion 3(재귀3)

문제

https://www.hackerrank.com/challenges/30-recursion/problem?h_r=email&unlock_token=7f4030ba285191d3e9b9bd7857e44cff8268f79d&utm_campaign=30_days_of_code_continuous&utm_medium=email&utm_source=daily_reminder

Day 9: Recursion 3 | HackerRank

문제 설명

재귀로 누적곱을 구하는 문제

 

성공 코드

public class Solution {
 
    // Complete the factorial function below.
    static int factorial(int n) {
        return (n == 1) ? 1 : n*factorial(n-1);
    }
 
    private static final Scanner scanner = new Scanner(System.in);
 
    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
 
        int n = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
 
        int result = factorial(n);
 
        bufferedWriter.write(String.valueOf(result));
        bufferedWriter.newLine();
 
        bufferedWriter.close();
 
        scanner.close();
    }
}