描述 设计一个算法,计算出n阶乘中尾部零的个数 样例 11! = 39916800,因此应该返回 2 挑战 O(logN)的时间复杂度 题解 1234567891011121314 class { * param n: As desciption * return: An integer, denote the number of trailing zeros in n! */ public long trailingZeros(long n) { long sum = 0; while (n != 0) { sum += n / 5; n /= 5; } return sum; }}; 赞微海报分享
近期评论