题目:
Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
java代码实现:
</pre><pre name="code" class="html">class Solution {
public int trailingZeroes(int n) {
int count = 0;
for (long i=5; n/i>=1; i *= 5) //用int会有偏差
count += n/i;
return count;
}
}