Factorial Trailing Zeroes

参考：点击打开链接

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