思路:计算n能被5,25,。。。b整除的个数
代码如下:
public class Solution
{
public int trailingZeroes(int n)
{
int sum = 0;
while (n > 0)
{
sum += n / 5;
n /= 5;
}
return sum;
}
}
思路:计算n能被5,25,。。。b整除的个数
代码如下:
public class Solution
{
public int trailingZeroes(int n)
{
int sum = 0;
while (n > 0)
{
sum += n / 5;
n /= 5;
}
return sum;
}
}