g0101_0200.s0172_factorial_trailing_zeroes.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation
Show all versions of leetcode-in-java Show documentation
Java-based LeetCode algorithm problem solutions, regularly updated
package g0101_0200.s0172_factorial_trailing_zeroes;
// #Medium #Top_Interview_Questions #Math #Udemy_Integers
// #2022_06_26_Time_1_ms_(85.61%)_Space_42.1_MB_(7.61%)
public class Solution {
public int trailingZeroes(int n) {
int base = 5;
int count = 0;
while (n >= base) {
count += n / base;
base = base * 5;
}
return count;
}
}