mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
28 lines
1.2 KiB
HTML
28 lines
1.2 KiB
HTML
<p>A permutation <code>perm</code> of <code>n + 1</code> integers of all the integers in the range <code>[0, n]</code> can be represented as a string <code>s</code> of length <code>n</code> where:</p>
|
|
|
|
<ul>
|
|
<li><code>s[i] == 'I'</code> if <code>perm[i] < perm[i + 1]</code>, and</li>
|
|
<li><code>s[i] == 'D'</code> if <code>perm[i] > perm[i + 1]</code>.</li>
|
|
</ul>
|
|
|
|
<p>Given a string <code>s</code>, reconstruct the permutation <code>perm</code> and return it. If there are multiple valid permutations perm, return <strong>any of them</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> s = "IDID"
|
|
<strong>Output:</strong> [0,4,1,3,2]
|
|
</pre><p><strong class="example">Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> s = "III"
|
|
<strong>Output:</strong> [0,1,2,3]
|
|
</pre><p><strong class="example">Example 3:</strong></p>
|
|
<pre><strong>Input:</strong> s = "DDI"
|
|
<strong>Output:</strong> [3,2,0,1]
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length <= 10<sup>5</sup></code></li>
|
|
<li><code>s[i]</code> is either <code>'I'</code> or <code>'D'</code>.</li>
|
|
</ul>
|