设计一个算法,计算出n阶乘中尾部零的个数
样例
11! = 39916800,因此应该返回 2
挑战
O(logN)的时间复杂度
这种直接数有多少个0的方法,即包含多少个5,时间复杂度大于O(n)在时间上是通不过的,会提示超时。
class Solution {
public:
/*
* @param n: A long integer
* @return: An integer, denote the number of trailing zeros in n!
*/
long long trailingZeros(long long n) {
// write your code here, try to do it without arithmetic operators.
long long count=1;
long long other_count=0;
while(count*5<=n){
long long temp_num=count;
while(temp_num%5==0){
other_count++;
temp_num=temp_num/5;
}
count++;
}
return count+other_count-1;
}
};
我们采用另一种思路,先统计可以整除5的个数,在统计整除25,125······,时间复杂度是O(log(n)),可以AC:
class Solution {
public:
/*
* @param n: A long integer
* @return: An integer, denote the number of trailing zeros in n!
*/
long long trailingZeros(long long n) {
// write your code here, try to do it without arithmetic operators.
long long five_times=1;
long long count=0;
while(five_times*5<=n){
five_times=five_times*5;
count+=n/five_times;
}
return count;
}
};