1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 21:16:45 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>数字 <code>n</code>&nbsp;代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且 <strong>有效的 </strong>括号组合。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 3\n<strong>输出:</strong>[\"((()))\",\"(()())\",\"(())()\",\"()(())\",\"()()()\"]\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>n = 1\n<strong>输出:</strong>[\"()\"]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= n &lt;= 8</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2492,
"likes": 2497,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Letter Combinations of a Phone Number\", \"titleSlug\": \"letter-combinations-of-a-phone-number\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u7535\\u8bdd\\u53f7\\u7801\\u7684\\u5b57\\u6bcd\\u7ec4\\u5408\"}, {\"title\": \"Valid Parentheses\", \"titleSlug\": \"valid-parentheses\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u6709\\u6548\\u7684\\u62ec\\u53f7\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"462.7K\", \"totalSubmission\": \"597.9K\", \"totalAcceptedRaw\": 462652, \"totalSubmissionRaw\": 597936, \"acRate\": \"77.4%\"}",
"stats": "{\"totalAccepted\": \"464.5K\", \"totalSubmission\": \"600.3K\", \"totalAcceptedRaw\": 464465, \"totalSubmissionRaw\": 600315, \"acRate\": \"77.4%\"}",
"hints": [],
"solution": {
"id": "62",