update

leetcode-cn/originData/bracket-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>括号。设计一种算法，打印n对括号的所有合法的（例如，开闭一一对应）组合。</p>\n\n<p>说明：解集不能包含重复的子集。</p>\n\n<p>例如，给出 n = 3，生成结果为：</p>\n\n<pre>\n[\n  \"((()))\",\n  \"(()())\",\n  \"(())()\",\n  \"()(())\",\n  \"()()()\"\n]\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 106,
+            "likes": 111,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"25.6K\", \"totalSubmission\": \"31.4K\", \"totalAcceptedRaw\": 25577, \"totalSubmissionRaw\": 31402, \"acRate\": \"81.5%\"}",
+            "stats": "{\"totalAccepted\": \"26.4K\", \"totalSubmission\": \"32.4K\", \"totalAcceptedRaw\": 26354, \"totalSubmissionRaw\": 32353, \"acRate\": \"81.5%\"}",
             "hints": [
                 "尝试简单构建法。",
                 "假设我们有编写两对括号的所有有效方法。怎么用这个来得到编写三对括号的所有有效方法？",