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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -0,0 +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>