[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.

Credits:
Special thanks to @ts for adding this problem and creating all test cases.

Hide Tags

  Math

Have you met this question in a real interview?  

Discuss

求阶乘里5的个数，数学题~

while（n一直除以5）就好啦

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