解法1: 递归法 思路: 0的个数为因子中5的个数 class Solution(object): def trailingZeroes(self, n): """ :type n: int :rtype: int """ if n < 5: return 0 return n//5 + self.trailingZeroes(n//5)