Add solution #942

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,026 LeetCode solutions in JavaScript
+# 1,027 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -751,6 +751,7 @@
 939|[Minimum Area Rectangle](./solutions/0939-minimum-area-rectangle.js)|Medium|
 940|[Distinct Subsequences II](./solutions/0940-distinct-subsequences-ii.js)|Hard|
 941|[Valid Mountain Array](./solutions/0941-valid-mountain-array.js)|Easy|
+942|[DI String Match](./solutions/0942-di-string-match.js)|Easy|
 966|[Vowel Spellchecker](./solutions/0966-vowel-spellchecker.js)|Medium|
 970|[Powerful Integers](./solutions/0970-powerful-integers.js)|Easy|
 976|[Largest Perimeter Triangle](./solutions/0976-largest-perimeter-triangle.js)|Easy|

solutions/0942-di-string-match.js

@@ -0,0 +1,36 @@
+/**
+ * 942. DI String Match
+ * https://leetcode.com/problems/di-string-match/
+ * Difficulty: Easy
+ *
+ * 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.
+ */
+
+/**
+ * @param {string} s
+ * @return {number[]}
+ */
+var diStringMatch = function(s) {
+  const result = [];
+  let low = 0;
+  let high = s.length;
+
+  for (const char of s) {
+    if (char === 'I') {
+      result.push(low);
+      low++;
+    } else {
+      result.push(high);
+      high--;
+    }
+  }
+
+  result.push(low);
+  return result;
+};