mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
18 lines
519 B
HTML
18 lines
519 B
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> 3! = 6, no trailing zero.</pre>
|
|
|
|
<p><strong>Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> 5
|
|
<strong>Output:</strong> 1
|
|
<strong>Explanation:</strong> 5! = 120, one trailing zero.</pre>
|
|
|
|
<p><b>Note: </b>Your solution should be in logarithmic time complexity.</p>
|