尾部的零
设计一个算法,计算出n阶乘中尾部零的个数
样例
参考: http://blog.csdn.net/tina_yaoyao/article/details/50042991
11! = 39916800,因此应该返回 2
class Solution {
/*
* param n: As desciption
* return: An integer, denote the number of trailing zeros in n!
*/
public long trailingZeros(long n) {
// write your code here
long m = 0;
while(n > 0) {
m += n / 5;
n = n / 5;
}
return m;
}
};
参考: http://blog.csdn.net/tina_yaoyao/article/details/50042991