update

leetcode-cn/originData/three-divisors.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数 <code>n</code> 。如果 <code>n</code> <strong>恰好有三个正除数</strong> ，返回 <code>true</code><em> </em>；否则，返回<em> </em><code>false</code> 。</p>\n\n<p>如果存在整数 <code>k</code> ，满足 <code>n = k * m</code> ，那么整数 <code>m</code> 就是 <code>n</code> 的一个 <strong>除数</strong> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre><strong>输入：</strong>n = 2\n<strong>输出：</strong>false\n<strong>解释：</strong>2 只有两个除数：1 和 2 。</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre><strong>输入：</strong>n = 4\n<strong>输出：</strong>true\n<strong>解释：</strong>4 有三个除数：1、2 和 4 。\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 14,
+            "likes": 15,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"16.1K\", \"totalAcceptedRaw\": 8766, \"totalSubmissionRaw\": 16093, \"acRate\": \"54.5%\"}",
+            "stats": "{\"totalAccepted\": \"8.8K\", \"totalSubmission\": \"16.2K\", \"totalAcceptedRaw\": 8800, \"totalSubmissionRaw\": 16157, \"acRate\": \"54.5%\"}",
             "hints": [
                 "You can count the number of divisors and just check that they are 3",
                 "Beware of the case of n equal 1 as some solutions might fail in it"