LeetCode 0172 - Factorial Trailing Zeroes

Factorial Trailing Zeroes

Desicription

Given an integer n, return the number of trailing zeroes in n!.

Example 1:

代码语言：javascript复制

Input: 3
Output: 0
Explanation: 3! = 6, no trailing zero.

Example 2:

代码语言：javascript复制

Input: 5
Output: 1
Explanation: 5! = 120, one trailing zero.

Note: Your solution should be in logarithmic time complexity.

Solution

代码语言：javascript复制

class Solution {
public:
    long long trailingZeroes(long long n) {
        long long res = 0;
        for(long long i = 5; n / i; i *= 5)
            res  = n / i;
        return res;
    }
};

factorial integer return time

0 人点赞