feat: add solutions to lc problem: No.1807

No.1807.Evaluate the Bracket Pairs of a String

Author: YangFong

solution/1800-1899/1807.Evaluate the Bracket Pairs of a String/README.md

@@ -188,6 +188,66 @@ func evaluate(s string, knowledge [][]string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function evaluate(s: string, knowledge: string[][]): string {
+    const n = s.length;
+    const map = new Map();
+    for (const [k, v] of knowledge) {
+        map.set(k, v);
+    }
+    const ans = [];
+    let i = 0;
+    while (i < n) {
+        if (s[i] === '(') {
+            const j = s.indexOf(')', i + 1);
+            ans.push(map.get(s.slice(i + 1, j)) ?? '?');
+            i = j;
+        } else {
+            ans.push(s[i]);
+        }
+        i++;
+    }
+    return ans.join('');
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+impl Solution {
+    pub fn evaluate(s: String, knowledge: Vec<Vec<String>>) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut map = HashMap::new();
+        for v in knowledge.iter() {
+            map.insert(&v[0], &v[1]);
+        }
+        let mut ans = String::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] == b'(' {
+                i += 1;
+                let mut j = i;
+                let mut key = String::new();
+                while s[j] != b')' {
+                    key.push(s[j] as char);
+                    j += 1;
+                }
+                ans.push_str(map.get(&key).unwrap_or(&&'?'.to_string()));
+                i = j;
+            } else {
+                ans.push(s[i] as char);
+            }
+            i += 1;
+        }
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1807.Evaluate the Bracket Pairs of a String/README_EN.md

@@ -170,6 +170,66 @@ func evaluate(s string, knowledge [][]string) string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function evaluate(s: string, knowledge: string[][]): string {
+    const n = s.length;
+    const map = new Map();
+    for (const [k, v] of knowledge) {
+        map.set(k, v);
+    }
+    const ans = [];
+    let i = 0;
+    while (i < n) {
+        if (s[i] === '(') {
+            const j = s.indexOf(')', i + 1);
+            ans.push(map.get(s.slice(i + 1, j)) ?? '?');
+            i = j;
+        } else {
+            ans.push(s[i]);
+        }
+        i++;
+    }
+    return ans.join('');
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+impl Solution {
+    pub fn evaluate(s: String, knowledge: Vec<Vec<String>>) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut map = HashMap::new();
+        for v in knowledge.iter() {
+            map.insert(&v[0], &v[1]);
+        }
+        let mut ans = String::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] == b'(' {
+                i += 1;
+                let mut j = i;
+                let mut key = String::new();
+                while s[j] != b')' {
+                    key.push(s[j] as char);
+                    j += 1;
+                }
+                ans.push_str(map.get(&key).unwrap_or(&&'?'.to_string()));
+                i = j;
+            } else {
+                ans.push(s[i] as char);
+            }
+            i += 1;
+        }
+        ans
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1807.Evaluate the Bracket Pairs of a String/Solution.rs

@@ -0,0 +1,30 @@
+use std::collections::HashMap;
+impl Solution {
+    pub fn evaluate(s: String, knowledge: Vec<Vec<String>>) -> String {
+        let s = s.as_bytes();
+        let n = s.len();
+        let mut map = HashMap::new();
+        for v in knowledge.iter() {
+            map.insert(&v[0], &v[1]);
+        }
+        let mut ans = String::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] == b'(' {
+                i += 1;
+                let mut j = i;
+                let mut key = String::new();
+                while s[j] != b')' {
+                    key.push(s[j] as char);
+                    j += 1;
+                }
+                ans.push_str(map.get(&key).unwrap_or(&&'?'.to_string()));
+                i = j;
+            } else {
+                ans.push(s[i] as char);
+            }
+            i += 1;
+        }
+        ans
+    }
+}

solution/1800-1899/1807.Evaluate the Bracket Pairs of a String/Solution.ts

@@ -0,0 +1,20 @@
+function evaluate(s: string, knowledge: string[][]): string {
+    const n = s.length;
+    const map = new Map();
+    for (const [k, v] of knowledge) {
+        map.set(k, v);
+    }
+    const ans = [];
+    let i = 0;
+    while (i < n) {
+        if (s[i] === '(') {
+            const j = s.indexOf(')', i + 1);
+            ans.push(map.get(s.slice(i + 1, j)) ?? '?');
+            i = j;
+        } else {
+            ans.push(s[i]);
+        }
+        i++;
+    }
+    return ans.join('');
+}