leetcode-problemset/leetcode-cn/problem (English)/阶乘尾数(English) [factorial-zeros-lcci].html

<p>Write an algorithm which computes the number of trailing zeros in n factorial.</p>

<p><strong>Example 1:</strong></p>

<pre>
<strong>Input:</strong> 3
<strong>Output:</strong> 0
<strong>Explanation:</strong>&nbsp;3! = 6, no trailing zero.</pre>

<p><strong>Example&nbsp;2:</strong></p>

<pre>
<strong>Input:</strong> 5
<strong>Output:</strong> 1
<strong>Explanation:</strong>&nbsp;5! = 120, one trailing zero.</pre>

<p><b>Note:&nbsp;</b>Your solution should be in logarithmic time complexity.</p>