Package g0901_1000.s0942_di_string_match
Class Solution
-
- All Implemented Interfaces:
public final class Solution
942 - DI String Match\.
Easy
A permutation
perm
ofn + 1
integers of all the integers in the range[0, n]
can be represented as a strings
of lengthn
where:s[i] == 'I'
ifperm[i] < perm[i + 1]
, ands[i] == 'D'
ifperm[i] > perm[i + 1]
.
Given a string
s
, reconstruct the permutationperm
and return it. If there are multiple valid permutations perm, return any of them.Example 1:
Input: s = "IDID"
Output: 0,4,1,3,2
Example 2:
Input: s = "III"
Output: 0,1,2,3
Example 3:
Input: s = "DDI"
Output: 3,2,0,1
Constraints:
<code>1 <= s.length <= 10<sup>5</sup></code>
s[i]
is either'I'
or'D'
.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final IntArray
diStringMatch(String s)
-
-
Method Detail
-
diStringMatch
final IntArray diStringMatch(String s)
-
-
-
-