feat: add rust solution to lc problem: No.2707 (#1568)

Author: xzhseh

solution/2700-2799/2707.Extra Characters in a String/README.md

@@ -112,6 +112,39 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_extra_char(s: String, dictionary: Vec<String>) -> i32 {
+        let n = s.len();
+        let mut set = dictionary
+            .iter()
+            .map(|s| s.into())
+            .collect::<HashSet<String>>();
+        let mut dp = vec![0; n + 1];
+
+        // Initialize the dp vector
+        dp[0] = 0;
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            dp[i] = dp[i - 1] + 1;
+            for j in 0..i {
+                if set.contains(&s[j..i]) {
+                    dp[i] = std::cmp::min(dp[i], dp[j]);
+                }
+            }
+        }
+
+        dp[n]
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/2700-2799/2707.Extra Characters in a String/README_EN.md

@@ -105,6 +105,39 @@ public:
 };
 ```
 
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_extra_char(s: String, dictionary: Vec<String>) -> i32 {
+        let n = s.len();
+        let mut set = dictionary
+            .iter()
+            .map(|s| s.into())
+            .collect::<HashSet<String>>();
+        let mut dp = vec![0; n + 1];
+
+        // Initialize the dp vector
+        dp[0] = 0;
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            dp[i] = dp[i - 1] + 1;
+            for j in 0..i {
+                if set.contains(&s[j..i]) {
+                    dp[i] = std::cmp::min(dp[i], dp[j]);
+                }
+            }
+        }
+
+        dp[n]
+    }
+}
+```
+
 ### **Go**
 
 ```go

solution/2700-2799/2707.Extra Characters in a String/Solution.rs

@@ -0,0 +1,28 @@
+use std::collections::HashSet;
+
+impl Solution {
+    #[allow(dead_code)]
+    pub fn min_extra_char(s: String, dictionary: Vec<String>) -> i32 {
+        let n = s.len();
+        let mut set = dictionary
+            .iter()
+            .map(|s| s.into())
+            .collect::<HashSet<String>>();
+        let mut dp = vec![0; n + 1];
+
+        // Initialize the dp vector
+        dp[0] = 0;
+
+        // Begin the actual dp process
+        for i in 1..=n {
+            dp[i] = dp[i - 1] + 1;
+            for j in 0..i {
+                if set.contains(&s[j..i]) {
+                    dp[i] = std::cmp::min(dp[i], dp[j]);
+                }
+            }
+        }
+
+        dp[n]
+    }
+}