update

leetcode-cn/originData/perfect-squares.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数 <code>n</code> ，返回 <em>和为 <code>n</code> 的完全平方数的最少数量</em> 。</p>\n\n<p><strong>完全平方数</strong> 是一个整数，其值等于另一个整数的平方；换句话说，其值等于一个整数自乘的积。例如，<code>1</code>、<code>4</code>、<code>9</code> 和 <code>16</code> 都是完全平方数，而 <code>3</code> 和 <code>11</code> 不是。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例&nbsp;1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = <code>12</code>\n<strong>输出：</strong>3 \n<strong>解释：</strong><code>12 = 4 + 4 + 4</code></pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = <code>13</code>\n<strong>输出：</strong>2\n<strong>解释：</strong><code>13 = 4 + 9</code></pre>\n&nbsp;\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": "Medium",
-            "likes": 1298,
+            "likes": 1339,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Count Primes\", \"titleSlug\": \"count-primes\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8ba1\\u6570\\u8d28\\u6570\"}, {\"title\": \"Ugly Number II\", \"titleSlug\": \"ugly-number-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u4e11\\u6570 II\"}]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"260K\", \"totalSubmission\": \"403.7K\", \"totalAcceptedRaw\": 259971, \"totalSubmissionRaw\": 403694, \"acRate\": \"64.4%\"}",
+            "stats": "{\"totalAccepted\": \"273.1K\", \"totalSubmission\": \"422.5K\", \"totalAcceptedRaw\": 273098, \"totalSubmissionRaw\": 422519, \"acRate\": \"64.6%\"}",
             "hints": [],
             "solution": null,
             "status": null,