coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -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>&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>
<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>