coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,15 +1,17 @@
<p>设计一个算法，算出 n 阶乘有多少个尾随零。</p>
<p><strong>示例 1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:</strong> 3
<strong>输出:</strong> 0
<strong>解释:</strong>&nbsp;3! = 6, 尾数中没有零。</pre>
<pre>
<strong>输入：</strong>3
<strong>输出：</strong>0
<strong>解释：</strong>3! = 6, 尾数中没有零。</pre>
<p><strong>示例&nbsp;2:</strong></p>
<p><strong>示例&nbsp;2：</strong></p>
<pre><strong>输入:</strong> 5
<strong>输出:</strong> 1
<strong>解释:</strong>&nbsp;5! = 120, 尾数中有 1 个零.</pre>
<pre>
<strong>输入：</strong>5
<strong>输出：</strong>1
<strong>解释：</strong>5! = 120, 尾数中有 1 个零.</pre>
<p><strong>说明: </strong>你算法的时间复杂度应为&nbsp;<em>O</em>(log&nbsp;<em>n</em>)<em>&nbsp;</em>。</p>