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.
Subscribe to see which companies asked this question
考虑n的阶层后有几个零
出现零的情况就是5*[2,4,6,8]
也就是考虑在1-n中5有多少个
class Solution {
public:
int trailingZeroes(int n) {
if(n<=0) return 0;
int cnt=0;
while(n/5){
n/=5;
cnt+=n;
}
return cnt;
}
};