首页 > itarticle > 172. factorial trailing zeroes

172. factorial trailing zeroes

admin 11月 12, 2020 0

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