mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>由范围 <code>[0,n]</code> 内所有整数组成的 <code>n + 1</code> 个整数的排列序列可以表示为长度为 <code>n</code> 的字符串 <code>s</code> ,其中:</p>\n\n<ul>\n\t<li>如果 <code>perm[i] < perm[i + 1]</code> ,那么 <code>s[i] == 'I'</code> </li>\n\t<li>如果 <code>perm[i] > perm[i + 1]</code> ,那么 <code>s[i] == 'D'</code> </li>\n</ul>\n\n<p>给定一个字符串 <code>s</code> ,重构排列 <code>perm</code> 并返回它。如果有多个有效排列perm,则返回其中 <strong>任何一个</strong> 。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"IDID\"\n<strong>输出:</strong>[0,4,1,3,2]\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"III\"\n<strong>输出:</strong>[0,1,2,3]\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"DDI\"\n<strong>输出:</strong>[3,2,0,1]</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= s.length <= 10<sup>5</sup></code></li>\n\t<li><code><font color=\"#c7254e\"><font face=\"Menlo, Monaco, Consolas, Courier New, monospace\"><span style=\"font-size:12.6px\"><span style=\"background-color:#f9f2f4\">s</span></span></font></font></code> 只包含字符 <code>\"I\"</code> 或 <code>\"D\"</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 256,
|
||||
"likes": 259,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"25.7K\", \"totalSubmission\": \"34.9K\", \"totalAcceptedRaw\": 25652, \"totalSubmissionRaw\": 34919, \"acRate\": \"73.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"26.2K\", \"totalSubmission\": \"35.7K\", \"totalAcceptedRaw\": 26235, \"totalSubmissionRaw\": 35749, \"acRate\": \"73.4%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user