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.

Solution

public class Solution {
     public int trailingZeroes(int n) {
        int r = 0;

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

        return r;
    }
}