update

leetcode-cn/originData/palindrome-permutation-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个字符串，编写一个函数判定其是否为某个回文串的排列之一。</p>\n\n<p>回文串是指正反两个方向都一样的单词或短语。排列是指字母的重新排列。</p>\n\n<p>回文串不一定是字典当中的单词。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例1：</strong></p>\n\n<pre><strong>输入：&quot;</strong>tactcoa&quot;\n<strong>输出：</strong>true（排列有&quot;tacocat&quot;、&quot;atcocta&quot;，等等）\n</pre>\n\n<p>&nbsp;</p>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 74,
+            "likes": 80,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"50.6K\", \"totalSubmission\": \"93K\", \"totalAcceptedRaw\": 50566, \"totalSubmissionRaw\": 92964, \"acRate\": \"54.4%\"}",
+            "stats": "{\"totalAccepted\": \"52.3K\", \"totalSubmission\": \"96.2K\", \"totalAcceptedRaw\": 52301, \"totalSubmissionRaw\": 96208, \"acRate\": \"54.4%\"}",
             "hints": [
                 "你不必且也不应该生成所有的排列。这将极为低效。",
                 "作为回文排列的字符串有什么特征？",