LeetCode 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.

public class Solution {
    public int trailingZeroes(int n) {
        if (n <= 1) {
            return 0;
        }
        long c2=0;
        long c5=0;
        for (int i = n; i > 1; i--) {
            int k=i;
            while (k % 5 == 0) {
                c5++;
                k = k / 5;
            }
            while (k % 2 == 0) {
                c2++;
                k = k / 2;
            }
        }
        return (int) Math.min(c2, c5);
    }
}