LeetCode || Factorial Trailing Zeroes

class Solution {
public:
    int trailingZeroes(int n) {
        //找到所有的5
        int num = 0;
        while(n)
        {
            num += n/5;
            n = n / 5;
        }
        return num;
    }
};