feat: add solutions to lc problem: No.1805

No.1805.Number of Different Integers in a String

Author: YangFong

solution/1800-1899/1805.Number of Different Integers in a String/README.md

@@ -158,6 +158,51 @@ func numDifferentIntegers(word string) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numDifferentIntegers(word: string): number {
+    return new Set(
+        word
+            .replace(/\D+/g, ' ')
+            .trim()
+            .split(' ')
+            .filter(v => v !== '')
+            .map(v => v.replace(/^0+/g, '')),
+    ).size;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_different_integers(word: String) -> i32 {
+        let s = word.as_bytes();
+        let n = s.len();
+        let mut set = HashSet::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] >= b'0' && s[i] <= b'9' {
+                let mut j = i;
+                while j < n && s[j] >= b'0' && s[j] <= b'9' {
+                    j += 1;
+                }
+                while i < j - 1 && s[i] == b'0' {
+                    i += 1;
+                }
+                set.insert(String::from_utf8(s[i..j].to_vec()).unwrap());
+                i = j;
+            } else {
+                i += 1;
+            }
+        }
+        set.len() as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1805.Number of Different Integers in a String/README_EN.md

@@ -139,6 +139,51 @@ func numDifferentIntegers(word string) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numDifferentIntegers(word: string): number {
+    return new Set(
+        word
+            .replace(/\D+/g, ' ')
+            .trim()
+            .split(' ')
+            .filter(v => v !== '')
+            .map(v => v.replace(/^0+/g, '')),
+    ).size;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_different_integers(word: String) -> i32 {
+        let s = word.as_bytes();
+        let n = s.len();
+        let mut set = HashSet::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] >= b'0' && s[i] <= b'9' {
+                let mut j = i;
+                while j < n && s[j] >= b'0' && s[j] <= b'9' {
+                    j += 1;
+                }
+                while i < j - 1 && s[i] == b'0' {
+                    i += 1;
+                }
+                set.insert(String::from_utf8(s[i..j].to_vec()).unwrap());
+                i = j;
+            } else {
+                i += 1;
+            }
+        }
+        set.len() as i32
+    }
+}
+```
+
 ### **...**
 
 ```

solution/1800-1899/1805.Number of Different Integers in a String/Solution.rs

@@ -0,0 +1,25 @@
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_different_integers(word: String) -> i32 {
+        let s = word.as_bytes();
+        let n = s.len();
+        let mut set = HashSet::new();
+        let mut i = 0;
+        while i < n {
+            if s[i] >= b'0' && s[i] <= b'9' {
+                let mut j = i;
+                while j < n && s[j] >= b'0' && s[j] <= b'9' {
+                    j += 1;
+                }
+                while i < j - 1 && s[i] == b'0' {
+                    i += 1;
+                }
+                set.insert(String::from_utf8(s[i..j].to_vec()).unwrap());
+                i = j;
+            } else {
+                i += 1;
+            }
+        }
+        set.len() as i32
+    }
+}

solution/1800-1899/1805.Number of Different Integers in a String/Solution.ts

@@ -0,0 +1,10 @@
+function numDifferentIntegers(word: string): number {
+    return new Set(
+        word
+            .replace(/\D+/g, ' ')
+            .trim()
+            .split(' ')
+            .filter(v => v !== '')
+            .map(v => v.replace(/^0+/g, '')),
+    ).size;
+}