Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity
题目的含义是获取整数n!尾部0的个数,其实就是看n!这个整数中2和5银子的个数,因为5的个数肯定比2少,所以最终的决定性因素是n!中5的因子个数。可以采用n/5+n/25+n/125+...的方式求得。
class Solution {
public:
int trailingZeroes(int n) {
int step = 0;
while(n)
{
step += n/5;
n = n/5;
}
return step;
}
};