1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 13:36:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给定一个经过编码的字符串,返回它解码后的字符串。</p>\n\n<p>编码规则为: <code>k[encoded_string]</code>,表示其中方括号内部的 <code>encoded_string</code> 正好重复 <code>k</code> 次。注意 <code>k</code> 保证为正整数。</p>\n\n<p>你可以认为输入字符串总是有效的;输入字符串中没有额外的空格,且输入的方括号总是符合格式要求的。</p>\n\n<p>此外,你可以认为原始数据不包含数字,所有的数字只表示重复的次数 <code>k</code> ,例如不会出现像&nbsp;<code>3a</code>&nbsp;或&nbsp;<code>2[4]</code>&nbsp;的输入。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"3[a]2[bc]\"\n<strong>输出:</strong>\"aaabcbc\"\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"3[a2[c]]\"\n<strong>输出:</strong>\"accaccacc\"\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"2[abc]3[cd]ef\"\n<strong>输出:</strong>\"abcabccdcdcdef\"\n</pre>\n\n<p><strong>示例 4</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"abc3[cd]xyz\"\n<strong>输出:</strong>\"abccdcdcdxyz\"\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= s.length &lt;= 30</code></li>\n\t<li><meta charset=\"UTF-8\" /><code>s</code>&nbsp;由小写英文字母、数字和方括号<meta charset=\"UTF-8\" />&nbsp;<code>'[]'</code> 组成</li>\n\t<li><code>s</code>&nbsp;保证是一个&nbsp;<strong>有效</strong>&nbsp;的输入。</li>\n\t<li><code>s</code>&nbsp;中所有整数的取值范围为<meta charset=\"UTF-8\" />&nbsp;<code>[1, 300]</code>&nbsp;</li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 1081,
"likes": 1121,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Encode String with Shortest Length\", \"titleSlug\": \"encode-string-with-shortest-length\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u7f16\\u7801\\u6700\\u77ed\\u957f\\u5ea6\\u7684\\u5b57\\u7b26\\u4e32\"}, {\"title\": \"Number of Atoms\", \"titleSlug\": \"number-of-atoms\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u539f\\u5b50\\u7684\\u6570\\u91cf\"}, {\"title\": \"Brace Expansion\", \"titleSlug\": \"brace-expansion\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u82b1\\u62ec\\u53f7\\u5c55\\u5f00\"}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"154.2K\", \"totalSubmission\": \"275.9K\", \"totalAcceptedRaw\": 154152, \"totalSubmissionRaw\": 275871, \"acRate\": \"55.9%\"}",
"stats": "{\"totalAccepted\": \"162K\", \"totalSubmission\": \"289.3K\", \"totalAcceptedRaw\": 162029, \"totalSubmissionRaw\": 289259, \"acRate\": \"56.0%\"}",
"hints": [],
"solution": null,
"status": null,