public class Solution {
public int trailingZeroes(int n) {
if (n < 0) {
return -1;
}
int count = 0;
for (double i = 5; n / i >= 1; i *= 5) {//"double" to avoid overflow.
count += n / i;
}
return count;
}
}
Factorial Trailing Zeroes
最新推荐文章于 2019-08-21 17:15:00 发布