Given an integer n, return the number of trailing zeroes in n!.
Follow up: Could you write a solution that works in logarithmic time complexity?
Example 1:
Input: n = 3
Output: 0
Explanation: 3! = 6, no trailing zero.
Example 2:
Input: n = 5
Output: 1
Explanation: 5! = 120, one trailing zero.
Example 3:
Input: n = 0
Output: 0
Constraints:
1 <= n <= 104
此题差评的人有点多啊,大概是因为可以用暴力来解,直接算有几个5即可,我的解法如下:
class Solution {
public int trailingZeroes(int n) {
return n / 5 + n / 25 + n / 125 + n / 625 + n / 3125;
}
}
此解法取巧,比100%的解法快,比92%的解法省空间