172. Factorial Trailing Zeroes

作者: 衣介书生 | 来源:发表于2018-04-08 20:55 被阅读1次

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

Note: Your solution should be in logarithmic time complexity.
参考

class Solution {
    public int trailingZeroes(int n) {
        return n / 5 == 0 ? 0 : n / 5 + trailingZeroes(n / 5);
    }
}

leetcode:172. Factorial Trailing
172. Factorial Trailing Zeroes Description Given an integ...
[String]172. Factorial Trailing
题目：172. Factorial Trailing Zeroes Given an integer n, ret...
172. Factorial Trailing Zeroes
题目分析 Given an integer n, return the number of trailing ze...
172. Factorial Trailing Zeroes
Trailing 0s in n! = Count of 5s in prime factors of n!= f...
172. Factorial Trailing Zeroes
Problem Given an integer n, return the number of trailing...
172. Factorial Trailing Zeroes
http://www.purplemath.com/modules/factzero.htm2比5多，所以以5的数...
172. Factorial Trailing Zeroes
题目 Given an integer n, return the number of trailing zero...
172. Factorial Trailing Zeroes
问题 Given an integer n, return the number of trailing zero...
172. Factorial Trailing Zeroes
题目来自leetcode Given an integer n, return the number of tra...
172. Factorial Trailing Zeroes
Given an integer n, return the number of trailing zeroes ...