Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g0101_0200.s0172_factorial_trailing_zeroes.Solution

```
public class Solution
extends Object
```
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:
- 0 <= n <= 10⁴
Follow up: Could you write a solution that works in logarithmic time complexity?

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int trailingZeroes(int n)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail
- trailingZeroes
```
public int trailingZeroes(int n)
```