设计一个算法,计算出n阶乘中尾部零的个数
样例
11! = 39916800,因此应该返回 2
挑战
O(logN)的时间复杂度
class Solution {
/*
* param n: An desciption
* return: An integer, denote the number of trailing zeros in n!
*/
public long trailingZeros(long n) {
// write your code here
long count=0;
while(n/5>0){
count+=n/5;
n=n/5;
}
return count;
}
};