172. Factorial Trailing Zeroes.md

172. Factorial Trailing Zeroes

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

Example 1:

Input: 3
Output: 0
Explanation: 3! = 6, no trailing zero.

Example 2:

Input: 5
Output: 1
Explanation: 5! = 120, one trailing zero.

Solution

像高中数学的傻子题目。

Code

class Solution {
    public int trailingZeroes(int n) {
        int res = 0;
        while(n>0)
        {
            n /= 5;
            res += n;
        }
        return res;
    }
}