feat: add solutions to lc problem: No.2729 (doocs#1045)

Author: dierbei

solution/2700-2799/2729.Check if The Number is Fascinating/README.md

@@ -122,6 +122,66 @@ function isFascinating(n: number): boolean {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_fascinating(n: i32) -> bool {
+        let s = format!("{}{}{}", n, n * 2, n * 3);
+
+        let mut cnt = vec![0; 10];
+        for c in s.chars() {
+            let t = c as usize - '0' as usize;
+            cnt[t] += 1;
+            if cnt[t] > 1 {
+                return false;
+            }
+        }
+
+        cnt[0] == 0 && s.len() == 9
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn is_fascinating(mut n: i32) -> bool {
+        let mut i = n * 2;
+        let mut j = n * 3;
+
+        let mut hash = HashMap::new();
+
+        while n != 0 {
+            let cnt = hash.entry(n % 10).or_insert(0);
+            *cnt += 1;
+            n /= 10;
+        }
+
+        while i != 0 {
+            let cnt = hash.entry(i % 10).or_insert(0);
+            *cnt += 1;
+            i /= 10;
+        }
+
+        while j != 0 {
+            let cnt = hash.entry(j % 10).or_insert(0);
+            *cnt += 1;
+            j /= 10;
+        }
+
+        for k in 1..=9 {
+            if !hash.contains_key(&k) || hash[&k] > 1 {
+                return false
+            }
+        }
+
+        !hash.contains_key(&0)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2700-2799/2729.Check if The Number is Fascinating/README_EN.md

@@ -108,6 +108,66 @@ function isFascinating(n: number): boolean {
 }
 ```
 
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn is_fascinating(n: i32) -> bool {
+        let s = format!("{}{}{}", n, n * 2, n * 3);
+
+        let mut cnt = vec![0; 10];
+        for c in s.chars() {
+            let t = c as usize - '0' as usize;
+            cnt[t] += 1;
+            if cnt[t] > 1 {
+                return false;
+            }
+        }
+
+        cnt[0] == 0 && s.len() == 9
+    }
+}
+```
+
+```rust
+use std::collections::HashMap;
+
+impl Solution {
+    pub fn is_fascinating(mut n: i32) -> bool {
+        let mut i = n * 2;
+        let mut j = n * 3;
+
+        let mut hash = HashMap::new();
+
+        while n != 0 {
+            let cnt = hash.entry(n % 10).or_insert(0);
+            *cnt += 1;
+            n /= 10;
+        }
+
+        while i != 0 {
+            let cnt = hash.entry(i % 10).or_insert(0);
+            *cnt += 1;
+            i /= 10;
+        }
+
+        while j != 0 {
+            let cnt = hash.entry(j % 10).or_insert(0);
+            *cnt += 1;
+            j /= 10;
+        }
+
+        for k in 1..=9 {
+            if !hash.contains_key(&k) || hash[&k] > 1 {
+                return false
+            }
+        }
+
+        !hash.contains_key(&0)
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2700-2799/2729.Check if The Number is Fascinating/Solutions.rs

@@ -0,0 +1,16 @@
+impl Solution {
+    pub fn is_fascinating(n: i32) -> bool {
+        let s = format!("{}{}{}", n, n * 2, n * 3);
+
+        let mut cnt = vec![0; 10];
+        for c in s.chars() {
+            let t = c as usize - '0' as usize;
+            cnt[t] += 1;
+            if cnt[t] > 1 {
+                return false;
+            }
+        }
+
+        cnt[0] == 0 && s.len() == 9
+    }
+}