尾部的零
设计一个算法,计算出 n 阶乘中尾部零的个数样例
11! = 39916800,因此应该返回 2挑战
O (logN) 的时间复杂度
Java 代码实现:
package questions; | |
public class Solution2 { | |
public static long trailingZeros(long n) { | |
long count = 0; | |
while (n > 0) { | |
n = n/5; | |
count += n; | |
} | |
return count; | |
} | |
public static void main(String[] args) { | |
System.out.println(trailingZeros(10)); | |
} | |
} |