-
Notifications
You must be signed in to change notification settings - Fork 0
/
challenges-85.js
42 lines (31 loc) · 1013 Bytes
/
challenges-85.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// #Question - 942. DI String Match
// A permutation perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where:
// s[i] == 'I' if perm[i] < perm[i + 1], and
// s[i] == 'D' if perm[i] > perm[i + 1].
// Given a string s, reconstruct the permutation perm 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]
// #Solution
var diStringMatch = function (s) {
let newArr = [];
let min = 0;
let max = s.length;
for (let i = 0; i <= s.length; i++) {
if (s[i] === "I") {
newArr.push(min++);
} else {
newArr.push(max--);
}
}
return newArr;
};
console.log(diStringMatch("IDID")); // Output: [0, 4, 1, 3, 2]
console.log(diStringMatch("III")); // Output: [0, 1, 2, 3]
console.log(diStringMatch("DDI")); // Output: [3, 2, 0, 1]