Package g0101_0200.s0172_factorial_trailing_zeroes

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    172 - Factorial Trailing Zeroes\.

    Medium

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

    Note that n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1.

    Example 1:

    Input: n = 3

    Output: 0

    Explanation: 3! = 6, no trailing zero.

    Example 2:

    Input: n = 5

    Output: 1

    Explanation: 5! = 120, one trailing zero.

    Example 3:

    Input: n = 0

    Output: 0

    Constraints:

    • <code>0 <= n <= 10<sup>4</sup></code>

    Follow up: Could you write a solution that works in logarithmic time complexity?

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer trailingZeroes(Integer n)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait