172. Factorial Trailing Zeroes (计算n的阶乘尾部有多少个零)

版权声明:本文为博主原创文章,转载请声明原文出处:http://blog.csdn.net/xiangwanpeng https://blog.csdn.net/xiangwanpeng/article/details/52951236

Given an integer n, return the number of trailing zeroes in n!.

Note: Your solution should be in logarithmic time complexity.

public class Solution {
    public int trailingZeroes(int n) {
        int res = 0;
        while(n>0){
            res+=n/5;
            n/=5;
        }return res;
    }
}


展开阅读全文

没有更多推荐了,返回首页