172. Factorial Trailing Zeroes

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.

Note: Your solution should be in logarithmic time complexity.

Runtime: 8 ms, faster than 65.60% of C++ online submissions for Factorial Trailing Zeroes.

class Solution {
public:
    int trailingZeroes(int n) {
        int count = 0;
        int temp = n / 5;
        for (long long i = 5; temp > 0; i *= 5) {
            temp = n / i;
            count += temp;
        }
        return count;
    }
};