update

leetcode-cn/originData/factorial-trailing-zeroes.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个整数 <code>n</code> ，返回 <code>n!</code> 结果中尾随零的数量。</p>\n\n<p>提示&nbsp;<code>n! = n * (n - 1) * (n - 2) * ... * 3 * 2 * 1</code></p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 3\n<strong>输出：</strong>0\n<strong>解释：</strong>3! = 6 ，不含尾随 0\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 5\n<strong>输出：</strong>1\n<strong>解释：</strong>5! = 120 ，有一个尾随 0\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 0\n<strong>输出：</strong>0\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>0 &lt;= n &lt;= 10<sup>4</sup></code></li>\n</ul>\n\n<p>&nbsp;</p>\n\n<p><b>进阶：</b>你可以设计并实现对数时间复杂度的算法来解决此问题吗？</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 661,
+            "likes": 671,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Number of Digit One\", \"titleSlug\": \"number-of-digit-one\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u6570\\u5b57 1 \\u7684\\u4e2a\\u6570\"}, {\"title\": \"Preimage Size of Factorial Zeroes Function\", \"titleSlug\": \"preimage-size-of-factorial-zeroes-function\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u9636\\u4e58\\u51fd\\u6570\\u540e K \\u4e2a\\u96f6\"}]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"135.7K\", \"totalSubmission\": \"282.8K\", \"totalAcceptedRaw\": 135721, \"totalSubmissionRaw\": 282832, \"acRate\": \"48.0%\"}",
+            "stats": "{\"totalAccepted\": \"138.9K\", \"totalSubmission\": \"288.2K\", \"totalAcceptedRaw\": 138890, \"totalSubmissionRaw\": 288220, \"acRate\": \"48.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,