Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
public class Solution { public int trailingZeroes(int n) { int ans = 0; while(n >4){ ans+= n/5; n= n/5; } return ans; } }