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

Note: Your solution should be in logarithmic time complexity.

 

1 class Solution { 2 public: 3     int trailingZeroes(int n) { 4         int res=0; 5         while(n) 6         { 7             res+=n/5; 8             n/=5; 9         }10 11         return res;12     }13 };