feat: add solutions to leetcode problem: No.1805. Number of Different Integer in a String

Author: yanglbme

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

@@ -48,27 +48,49 @@
 	<li><code>word</code> 由数字和小写英文字母组成</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+将 `word` 按照字母切分，得到数字数组 `nums`，然后利用 set 去重，返回 set 的长度即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+import re
 
+class Solution:
+    def numDifferentIntegers(self, word: str) -> int:
+        nums = re.split(r'[a-z]+', word)
+        return len({int(num) for num in nums if num != ''})
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int numDifferentIntegers(String word) {
+        String[] nums = word.split("[a-z]+");
+        Set<String> numSet = new HashSet<>();
+        for (String num : nums) {
+            if ("".equals(num)) {
+                continue;
+            }
+            int j = 0;
+            while (j < num.length() - 1 && num.charAt(j) == '0') {
+                ++j;
+            }
+            numSet.add(num.substring(j));
+        }
+        return numSet.size();
+    }
+}
 ```
 
 ### **...**

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

@@ -45,21 +45,41 @@ the leading zeros are ignored when comparing their decimal values.
 	<li><code>word</code> consists of digits and lowercase English letters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
+import re
 
+class Solution:
+    def numDifferentIntegers(self, word: str) -> int:
+        nums = re.split(r'[a-z]+', word)
+        return len({int(num) for num in nums if num != ''})
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int numDifferentIntegers(String word) {
+        String[] nums = word.split("[a-z]+");
+        Set<String> numSet = new HashSet<>();
+        for (String num : nums) {
+            if ("".equals(num)) {
+                continue;
+            }
+            int j = 0;
+            while (j < num.length() - 1 && num.charAt(j) == '0') {
+                ++j;
+            }
+            numSet.add(num.substring(j));
+        }
+        return numSet.size();
+    }
+}
 ```
 
 ### **...**

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

@@ -0,0 +1,17 @@
+class Solution {
+    public int numDifferentIntegers(String word) {
+        String[] nums = word.split("[a-z]+");
+        Set<String> numSet = new HashSet<>();
+        for (String num : nums) {
+            if ("".equals(num)) {
+                continue;
+            }
+            int j = 0;
+            while (j < num.length() - 1 && num.charAt(j) == '0') {
+                ++j;
+            }
+            numSet.add(num.substring(j));
+        }
+        return numSet.size();
+    }
+}

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

@@ -0,0 +1,6 @@
+import re
+
+class Solution:
+    def numDifferentIntegers(self, word: str) -> int:
+        nums = re.split(r'[a-z]+', word)
+        return len({int(num) for num in nums if num != ''})