feat: add solutions to lc problems: No.0599

No.0599.Minimum Index Sum of Two Lists

Author: YangFong

solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md

@@ -162,6 +162,57 @@ func findRestaurant(list1 []string, list2 []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findRestaurant(list1: string[], list2: string[]): string[] {
+    let minI = Infinity;
+    const res = [];
+    const map = new Map<string, number>(list1.map((s, i) => [s, i]));
+    list2.forEach((s, i) => {
+        if (map.has(s)) {
+            const sumI = i + map.get(s);
+            if (sumI <= minI) {
+                if (sumI < minI) {
+                    minI = sumI;
+                    res.length = 0;
+                }
+                res.push(s);
+            }
+        }
+    });
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+use std::iter::FromIterator;
+
+impl Solution {
+    pub fn find_restaurant(list1: Vec<String>, list2: Vec<String>) -> Vec<String> {
+        let map: HashMap<String, usize> = HashMap::from_iter(list1.into_iter().zip(0..));
+        let mut res = vec![];
+        let mut min_i = usize::MAX;
+        list2.into_iter().enumerate().for_each(|(i, key)| {
+            if map.contains_key(&key) {
+                let sum_i = map.get(&key).unwrap() + i;
+                if sum_i <= min_i {
+                    if (sum_i < min_i) {
+                        min_i = sum_i;
+                        res.clear();
+                    }
+                    res.push(key);
+                }
+            }
+        });
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0599.Minimum Index Sum of Two Lists/README_EN.md

@@ -146,6 +146,57 @@ func findRestaurant(list1 []string, list2 []string) []string {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function findRestaurant(list1: string[], list2: string[]): string[] {
+    let minI = Infinity;
+    const res = [];
+    const map = new Map<string, number>(list1.map((s, i) => [s, i]));
+    list2.forEach((s, i) => {
+        if (map.has(s)) {
+            const sumI = i + map.get(s);
+            if (sumI <= minI) {
+                if (sumI < minI) {
+                    minI = sumI;
+                    res.length = 0;
+                }
+                res.push(s);
+            }
+        }
+    });
+    return res;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+use std::iter::FromIterator;
+
+impl Solution {
+    pub fn find_restaurant(list1: Vec<String>, list2: Vec<String>) -> Vec<String> {
+        let map: HashMap<String, usize> = HashMap::from_iter(list1.into_iter().zip(0..));
+        let mut res = vec![];
+        let mut min_i = usize::MAX;
+        list2.into_iter().enumerate().for_each(|(i, key)| {
+            if map.contains_key(&key) {
+                let sum_i = map.get(&key).unwrap() + i;
+                if sum_i <= min_i {
+                    if (sum_i < min_i) {
+                        min_i = sum_i;
+                        res.clear();
+                    }
+                    res.push(key);
+                }
+            }
+        });
+        res
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0599.Minimum Index Sum of Two Lists/Solution.rs

@@ -0,0 +1,23 @@
+use std::collections::HashMap;
+use std::iter::FromIterator;
+
+impl Solution {
+    pub fn find_restaurant(list1: Vec<String>, list2: Vec<String>) -> Vec<String> {
+        let map: HashMap<String, usize> = HashMap::from_iter(list1.into_iter().zip(0..));
+        let mut res = vec![];
+        let mut min_i = usize::MAX;
+        list2.into_iter().enumerate().for_each(|(i, key)| {
+            if map.contains_key(&key) {
+                let sum_i = map.get(&key).unwrap() + i;
+                if sum_i <= min_i {
+                    if (sum_i < min_i) {
+                        min_i = sum_i;
+                        res.clear();
+                    }
+                    res.push(key);
+                }
+            }
+        });
+        res
+    }
+}

solution/0500-0599/0599.Minimum Index Sum of Two Lists/Solution.ts

@@ -0,0 +1,18 @@
+function findRestaurant(list1: string[], list2: string[]): string[] {
+    let minI = Infinity;
+    const res = [];
+    const map = new Map<string, number>(list1.map((s, i) => [s, i]));
+    list2.forEach((s, i) => {
+        if (map.has(s)) {
+            const sumI = i + map.get(s);
+            if (sumI <= minI) {
+                if (sumI < minI) {
+                    minI = sumI;
+                    res.length = 0;
+                }
+                res.push(s);
+            }
+        }
+    });
+    return res;
+}