feat: update solutions to lc problem: No.2310

No.2310.Sum of Numbers With Units Digit K

Author: yanglbme

solution/2300-2399/2310.Sum of Numbers With Units Digit K/README.md

@@ -69,6 +69,8 @@
 
 我们从小到达枚举 $n$，找到第一个满足 $num-n*k$ 是 $10$ 的倍数的 $n$。由于 $n$ 不会超过 $num$，因此 $n$ 最大枚举至 $num$。
 
+也可以只考虑个位，个位满足，高位随意。
+
 **方法二：记忆化搜索**
 
 <!-- tabs:start -->
@@ -88,6 +90,17 @@ class Solution:
         return -1
 ```
 
+```python
+class Solution:
+    def minimumNumbers(self, num: int, k: int) -> int:
+        if num == 0:
+            return 0
+        for i in range(1, 11):
+            if (k * i) % 10 == num % 10 and k * i <= num:
+                return i
+        return -1
+```
+
 ```python
 class Solution:
     def minimumNumbers(self, num: int, k: int) -> int:
@@ -133,6 +146,22 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public int minimumNumbers(int num, int k) {
+        if (num == 0) {
+            return 0;
+        }
+        for (int i = 1; i <= 10; ++i) {
+            if ((k * i) % 10 ==  num % 10 && k * i <= num) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -150,6 +179,19 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    int minimumNumbers(int num, int k) {
+        if (!num) return 0;
+        for (int i = 1; i <= 10; ++i)
+            if ((k * i) % 10 == num % 10 && k * i <= num)
+                return i;
+        return -1;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -167,6 +209,20 @@ func minimumNumbers(num int, k int) int {
 }
 ```
 
+```go
+func minimumNumbers(num int, k int) int {
+	if num == 0 {
+		return 0
+	}
+	for i := 1; i <= 10; i++ {
+		if (k*i)%10 == num%10 && k*i <= num {
+			return i
+		}
+	}
+	return -1
+}
+```
+
 ### **TypeScript**
 
 ```ts

solution/2300-2399/2310.Sum of Numbers With Units Digit K/README_EN.md

@@ -73,6 +73,17 @@ class Solution:
         return -1
 ```
 
+```python
+class Solution:
+    def minimumNumbers(self, num: int, k: int) -> int:
+        if num == 0:
+            return 0
+        for i in range(1, 11):
+            if (k * i) % 10 == num % 10 and k * i <= num:
+                return i
+        return -1
+```
+
 ```python
 class Solution:
     def minimumNumbers(self, num: int, k: int) -> int:
@@ -116,6 +127,22 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public int minimumNumbers(int num, int k) {
+        if (num == 0) {
+            return 0;
+        }
+        for (int i = 1; i <= 10; ++i) {
+            if ((k * i) % 10 ==  num % 10 && k * i <= num) {
+                return i;
+            }
+        }
+        return -1;
+    }
+}
+```
+
 ### **C++**
 
 ```cpp
@@ -133,6 +160,19 @@ public:
 };
 ```
 
+```cpp
+class Solution {
+public:
+    int minimumNumbers(int num, int k) {
+        if (!num) return 0;
+        for (int i = 1; i <= 10; ++i)
+            if ((k * i) % 10 == num % 10 && k * i <= num)
+                return i;
+        return -1;
+    }
+};
+```
+
 ### **Go**
 
 ```go
@@ -150,6 +190,20 @@ func minimumNumbers(num int, k int) int {
 }
 ```
 
+```go
+func minimumNumbers(num int, k int) int {
+	if num == 0 {
+		return 0
+	}
+	for i := 1; i <= 10; i++ {
+		if (k*i)%10 == num%10 && k*i <= num {
+			return i
+		}
+	}
+	return -1
+}
+```
+
 ### **TypeScript**
 
 ```ts