【leetcode】Factorial Trailing Zeros

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 res=0;
        while(n)
        {
            res+=n/5;
            n/=5;
        }

        return res;
    }
};