[LeetCode] Problem 172 - Factorial Trailing Zeroes

Given an integer n, return the number of trailing zeroes in n!.

Example

No.1

Input: 3

Output: 0

Explanation: 3! = 6, no trailing zero.

No.2

Input: 5

Output: 1

Explanation: 5! = 120, one trailing zero.

Note

Your solution should be in logarithmic time complexity.

Code

public int trailingZeroes(int n) {
    return n == 0 ? 0 : n / 5 + trailingZeroes(n / 5);
}