172. Factorial Trailing Zeroes

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.

 

思路参考这里

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

 

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