feat: add rust solution to lc problem: No.0139 (doocs#1720)

Author: poltao

solution/0100-0199/0139.Word Break/README.md

@@ -480,6 +480,24 @@ class Trie {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
+        let words: std::collections::HashSet<String> = word_dict.into_iter().collect();
+        let mut f = vec![false; s.len() + 1];
+        f[0] = true;
+        for i in 1..=s.len() {
+            for j in 0..i {
+                f[i] |= f[j] && words.contains(&s[j..i]);
+            }
+        }
+        f[s.len()]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0139.Word Break/README_EN.md

@@ -454,6 +454,24 @@ class Trie {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
+        let words: std::collections::HashSet<String> = word_dict.into_iter().collect();
+        let mut f = vec![false; s.len() + 1];
+        f[0] = true;
+        for i in 1..=s.len() {
+            for j in 0..i {
+                f[i] |= f[j] && words.contains(&s[j..i]);
+            }
+        }
+        f[s.len()]
+    }
+}
+```
+
 ### **...**
 
 ```

solution/0100-0199/0139.Word Break/Solution.rs

@@ -0,0 +1,13 @@
+impl Solution {
+    pub fn word_break(s: String, word_dict: Vec<String>) -> bool {
+        let words: std::collections::HashSet<String> = word_dict.into_iter().collect();
+        let mut f = vec![false; s.len() + 1];
+        f[0] = true;
+        for i in 1..=s.len() {
+            for j in 0..i {
+                f[i] |= f[j] && words.contains(&s[j..i]);
+            }
+        }
+        f[s.len()]
+    }
+}