leetcode 172 Factorial Trailing Zeroes

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

Note: Your solution should be in logarithmic time complexity.

Credits:

Special thanks to @ts for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

class Solution {
public:
int trailingZeroes(int n) {
if(n < 1) return 0;
int cnt = 0;

while(n >= 5) {
cnt += n/5;
n = n/5;
}

return cnt;
}
}