mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-18 19:46:47 +08:00
更新国内版力扣题目描述变更
This commit is contained in:
@@ -1,17 +1,17 @@
|
||||
<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>
|
||||
<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>
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user