首页 > itarticle > [leetcode] problem 172 – factorial trailing zeroes

[leetcode] problem 172 – factorial trailing zeroes

admin 11月 13, 2020 0

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

Example

Input: 3

Output: 0

Explanation: 3! = 6, no trailing zero.

Input: 5

Output: 1

Explanation: 5! = 120, one trailing zero.

Your solution should be in logarithmic time complexity.

1
2
3

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