update

leetcode-cn/originData/factorial-zeros-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>设计一个算法，算出 n 阶乘有多少个尾随零。</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong> 3\n<strong>输出:</strong> 0\n<strong>解释:</strong>&nbsp;3! = 6, 尾数中没有零。</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre><strong>输入:</strong> 5\n<strong>输出:</strong> 1\n<strong>解释:</strong>&nbsp;5! = 120, 尾数中有 1 个零.</pre>\n\n<p><strong>说明: </strong>你算法的时间复杂度应为&nbsp;<em>O</em>(log&nbsp;<em>n</em>)<em>&nbsp;</em>。</p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 65,
+            "likes": 69,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"28.6K\", \"totalAcceptedRaw\": 13011, \"totalSubmissionRaw\": 28565, \"acRate\": \"45.5%\"}",
+            "stats": "{\"totalAccepted\": \"13.4K\", \"totalSubmission\": \"29.4K\", \"totalAcceptedRaw\": 13430, \"totalSubmissionRaw\": 29405, \"acRate\": \"45.7%\"}",
             "hints": [
                 "0如何变成n!？这是什么意思？",
                 "n!中的每个0表示n能被10整除一次。这是什么意思？",