[LeetCode] Factorial Trailing Zeroes

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

Note: Your solution should be in logarithmic time complexity.

class Solution {
public:
    int trailingZeroes(int n) {
        int ans = 0;
        while(n){
            ans += n / 5;
            n /= 5;
        }
        return ans;
    }
};