leetcode: 172. Factorial Trailing Zeroes

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


Note: Your solution should be in logarithmic time complexity.

n!质因数分解中，2的次幂一定大于5的次幂，所以0的个数取决于5的次幂有多少

代码

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