172. Factorial Trailing Zeroes
Easy
468
665
Favorite
Share 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.
思路:比如100!,只要查看5的个数,因为2肯定是够得
代码:python3
class Solution:
def trailingZeroes(self, n: int) -> int:
zeroCount = 0
while n > 0:
n=int(n/5)
zeroCount += n
return zeroCount
复制代码