mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-21 21:16:45 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个长度为 <code>n</code> 的字符串 <code>s</code> ,其中 <code>s[i]</code> 是:</p>\n\n<ul>\n\t<li><code>“D”</code> 意味着减少,或者</li>\n\t<li><code>“I”</code> 意味着增加</li>\n</ul>\n\n<p><strong>有效排列</strong> 是对有 <code>n + 1</code> 个在 <code>[0, n]</code> 范围内的整数的一个排列 <code>perm</code> ,使得对所有的 <code>i</code>:</p>\n\n<ul>\n\t<li>如果 <code>s[i] == 'D'</code>,那么 <code>perm[i] > perm[i+1]</code>,以及;</li>\n\t<li>如果 <code>s[i] == 'I'</code>,那么 <code>perm[i] < perm[i+1]</code>。</li>\n</ul>\n\n<p>返回 <em><strong>有效排列 </strong> </em><code>perm</code><em>的数量 </em>。因为答案可能很大,所以请<strong>返回你的答案对</strong> <code>10<sup>9</sup> + 7</code><strong> 取余</strong>。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>s = \"DID\"\n<strong>输出:</strong>5\n<strong>解释:</strong>\n(0, 1, 2, 3) 的五个有效排列是:\n(1, 0, 3, 2)\n(2, 0, 3, 1)\n(2, 1, 3, 0)\n(3, 0, 2, 1)\n(3, 1, 2, 0)\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong> s = \"D\"\n<strong>输出:</strong> 1\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>n == s.length</code></li>\n\t<li><code>1 <= n <= 200</code></li>\n\t<li><code>s[i]</code> 不是 <code>'I'</code> 就是 <code>'D'</code></li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 109,
|
||||
"likes": 112,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"3.2K\", \"totalSubmission\": \"5.9K\", \"totalAcceptedRaw\": 3198, \"totalSubmissionRaw\": 5896, \"acRate\": \"54.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 3280, \"totalSubmissionRaw\": 5998, \"acRate\": \"54.7%\"}",
|
||||
"hints": [],
|
||||
"solution": null,
|
||||
"status": null,
|
||||
|
Reference in New Issue
Block a user