update

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

@@ -12,7 +12,7 @@
             "translatedContent": "<p>有重复字符串的排列组合。编写一种方法，计算某字符串的所有排列组合。</p>\n\n<p><strong>示例1:</strong></p>\n\n<pre><strong> 输入</strong>：S = &quot;qqe&quot;\n<strong> 输出</strong>：[&quot;eqq&quot;,&quot;qeq&quot;,&quot;qqe&quot;]\n</pre>\n\n<p><strong>示例2:</strong></p>\n\n<pre><strong> 输入</strong>：S = &quot;ab&quot;\n<strong> 输出</strong>：[&quot;ab&quot;, &quot;ba&quot;]\n</pre>\n\n<p><strong>提示:</strong></p>\n\n<ol>\n\t<li>字符都是英文字母。</li>\n\t<li>字符串长度在[1, 9]之间。</li>\n</ol>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 60,
+            "likes": 61,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"19.7K\", \"totalSubmission\": \"27.6K\", \"totalAcceptedRaw\": 19652, \"totalSubmissionRaw\": 27590, \"acRate\": \"71.2%\"}",
+            "stats": "{\"totalAccepted\": \"19.7K\", \"totalSubmission\": \"27.7K\", \"totalAcceptedRaw\": 19708, \"totalSubmissionRaw\": 27661, \"acRate\": \"71.2%\"}",
             "hints": [
                 "你可以通过在打印之前检查是否有重复内容（或将它们添加到列表中）来处理此问题。你可以用散列表来做到这一点。在什么情况下，这样是可以的？在什么情况下，这可能不是一个很好的解法？",
                 "如果你还没有解决8.7的问题，就先解决那个。",