Given an integer n, return the number of trailing zeroes in n!.
Example 1:
Input: 3 Output: 0 Explanation: 3! = 6, no trailing zero.
Example 2:
Input: 5 Output: 1 Explanation: 5! = 120, one trailing zero.
Note: Your solution should be in logarithmic time complexity.
解决思路:
2的数量肯定比5要多,所以只需要找出5的个数即可。
/**
* @param {number} n
* @return {number}
*/
var trailingZeroes = function(n) {
let count = 0, x = 5;
while (x < n) {
count += n / x;
x *= 5;
}
return count;
};