Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
《编程之美》2.2不要被阶乘吓到。
class Solution {
public:
int trailingZeroes(
int n) {
int res =
0;
while(n){
res += n /
5;
n /=
5;
}
return res;
}
};
