feat: add solutions to lc problem: No.0942

No.0942.DI String Match

Author: YangFong

solution/0900-0999/0942.DI String Match/README.md

@@ -141,6 +141,50 @@ func diStringMatch(s string) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function diStringMatch(s: string): number[] {
+    const n = s.length;
+    const res = new Array(n + 1);
+    let low = 0;
+    let high = n;
+    for (let i = 0; i < n; i++) {
+        if (s[i] === 'I') {
+            res[i] = low++;
+        } else {
+            res[i] = high--;
+        }
+    }
+    res[n] = low;
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn di_string_match(s: String) -> Vec<i32> {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = Vec::with_capacity(n + 1);
+        let (mut low, mut high) = (-1, (n + 1) as i32);
+        for i in 0..n {
+            res.push(if s[i] == b'I' {
+                low += 1;
+                low
+            } else {
+                high -= 1;
+                high
+            });
+        }
+        res.push(low + 1);
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0942.DI String Match/README_EN.md

@@ -119,6 +119,50 @@ func diStringMatch(s string) []int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function diStringMatch(s: string): number[] {
+    const n = s.length;
+    const res = new Array(n + 1);
+    let low = 0;
+    let high = n;
+    for (let i = 0; i < n; i++) {
+        if (s[i] === 'I') {
+            res[i] = low++;
+        } else {
+            res[i] = high--;
+        }
+    }
+    res[n] = low;
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn di_string_match(s: String) -> Vec<i32> {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = Vec::with_capacity(n + 1);
+        let (mut low, mut high) = (-1, (n + 1) as i32);
+        for i in 0..n {
+            res.push(if s[i] == b'I' {
+                low += 1;
+                low
+            } else {
+                high -= 1;
+                high
+            });
+        }
+        res.push(low + 1);
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0900-0999/0942.DI String Match/Solution.rs

@@ -0,0 +1,19 @@
+impl Solution {
+    pub fn di_string_match(s: String) -> Vec<i32> {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut res = Vec::with_capacity(n + 1);
+        let (mut low, mut high) = (-1, (n + 1) as i32);
+        for i in 0..n {
+            res.push(if s[i] == b'I' {
+                low += 1;
+                low
+            } else {
+                high -= 1;
+                high
+            });
+        }
+        res.push(low + 1);
+        res
+    }
+}

solution/0900-0999/0942.DI String Match/Solution.ts

@@ -0,0 +1,15 @@
+function diStringMatch(s: string): number[] {
+    const n = s.length;
+    const res = new Array(n + 1);
+    let low = 0;
+    let high = n;
+    for (let i = 0; i < n; i++) {
+        if (s[i] === 'I') {
+            res[i] = low++;
+        } else {
+            res[i] = high--;
+        }
+    }
+    res[n] = low;
+    return res;
+}