DI String Match LeetCode solution in JavaScript

1
var diStringMatch = function (s) {
2
let i = 0,
3
d = s.length,
4
arr = [];
5

6
for (let j = 0; j <= s.length; j += 1) {
7
if (s[j] === "I") arr.push(i++);
8
else arr.push(d--);
9
}
10

11
return arr;
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0