Factorial Trailing Zeroes.md

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.

My code:

class Solution(object):
    def trailingZeroes(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n==0:
            return 0
        count=0
        check=5
        while check<=n:  
            count_5=int(n/check)
            count+=count_5
            check*=5
            
        return count

Solution: https://leetcode.com/problems/factorial-trailing-zeroes/