update

leetcode-cn/originData/reordered-power-of-2.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定正整数&nbsp;<code>n</code>&nbsp;，我们按任何顺序（包括原始顺序）将数字重新排序，注意其前导数字不能为零。</p>\n\n<p>如果我们可以通过上述方式得到&nbsp;2 的幂，返回 <code>true</code>；否则，返回 <code>false</code>。</p>\n\n<p>&nbsp;</p>\n\n<ol>\n</ol>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 1\n<strong>输出：</strong>true\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 10\n<strong>输出：</strong>false\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>9</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 147,
+            "likes": 148,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"33.6K\", \"totalSubmission\": \"52.4K\", \"totalAcceptedRaw\": 33579, \"totalSubmissionRaw\": 52385, \"acRate\": \"64.1%\"}",
+            "stats": "{\"totalAccepted\": \"33.9K\", \"totalSubmission\": \"52.9K\", \"totalAcceptedRaw\": 33867, \"totalSubmissionRaw\": 52853, \"acRate\": \"64.1%\"}",
             "hints": [],
             "solution": null,
             "status": null,