https://leetcode.com/problems/factorial-trailing-zeroes/description/
Given an integer n, return the number of trailing zeroes in n!.
Example 1:
Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero.
Example 2:
Input: 5 Output: 1 Explanation: 5! = 120, one trailing zero.
class Solution(object):
def trailingZeroes(self, n):
"""
:type n: int
:rtype: int
"""
count, i = 0, 5
while i <= n:
count += n / i
i *= 5
return count