feat: add rust solution to lc problem: No.0001 (#692)

No.0001.Two Sum

Author: SherlockGy

solution/0000-0099/0001.Two Sum/README.md

@@ -183,6 +183,25 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
 
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+pub fn soluation(nums: Vec<i32>, target: i32) -> Vec<i32> {
+    let mut map = HashMap::new();
+    for (i, item) in nums.iter().enumerate() {
+        if map.contains_key(item) {
+            return vec![i as i32, map[item]];
+        } else {
+            let x = target - nums[i];
+            map.insert(x, i as i32);
+        }
+    }
+    unreachable!()
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -169,6 +169,25 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
 
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashMap;
+
+pub fn soluation(nums: Vec<i32>, target: i32) -> Vec<i32> {
+    let mut map = HashMap::new();
+    for (i, item) in nums.iter().enumerate() {
+        if map.contains_key(item) {
+            return vec![i as i32, map[item]];
+        } else {
+            let x = target - nums[i];
+            map.insert(x, i as i32);
+        }
+    }
+    unreachable!()
+}
+```
+
 ### **...**
 
 ```

solution/0000-0099/0001.Two Sum/Solution.rs

@@ -0,0 +1,14 @@
+use std::collections::HashMap;
+
+pub fn soluation(nums: Vec<i32>, target: i32) -> Vec<i32> {
+    let mut map = HashMap::new();
+    for (i, item) in nums.iter().enumerate() {
+        if map.contains_key(item) {
+            return vec![i as i32, map[item]];
+        } else {
+            let x = target - nums[i];
+            map.insert(x, i as i32);
+        }
+    }
+    unreachable!()
+}