feat: add solutions to lc problems: No.1837, 1844

Author: yanglbme

solution/1800-1899/1837.Sum of Digits in Base K/README.md

@@ -37,27 +37,43 @@
 	<li><code>2 <= k <= 10</code></li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+将 n 除 k 取余，直至为 0，余数相加求得结果。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def sumBase(self, n: int, k: int) -> int:
+        res = 0
+        while n != 0:
+            n, t = divmod(n, k)
+            res += t
+        return res
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int sumBase(int n, int k) {
+        int res = 0;
+        while (n != 0) {
+            res += (n % k);
+            n /= k;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1837.Sum of Digits in Base K/README_EN.md

@@ -33,21 +33,35 @@
 	<li><code>2 &lt;= k &lt;= 10</code></li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def sumBase(self, n: int, k: int) -> int:
+        res = 0
+        while n != 0:
+            n, t = divmod(n, k)
+            res += t
+        return res
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int sumBase(int n, int k) {
+        int res = 0;
+        while (n != 0) {
+            res += (n % k);
+            n /= k;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1837.Sum of Digits in Base K/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int sumBase(int n, int k) {
+        int res = 0;
+        while (n != 0) {
+            res += (n % k);
+            n /= k;
+        }
+        return res;
+    }
+}

solution/1800-1899/1837.Sum of Digits in Base K/Solution.py

@@ -0,0 +1,7 @@
+class Solution:
+    def sumBase(self, n: int, k: int) -> int:
+        res = 0
+        while n != 0:
+            n, t = divmod(n, k)
+            res += t
+        return res

solution/1800-1899/1844.Replace All Digits with Characters/README.md

@@ -49,7 +49,6 @@
 	<li>对所有 <strong>奇数</strong> 下标处的 <code>i</code> ，满足 <code>shift(s[i-1], s[i]) &lt;= 'z'</code> 。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -61,15 +60,28 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def replaceDigits(self, s: str) -> str:
+        s = list(s)
+        for i in range(1, len(s), 2):
+            s[i] = chr(ord(s[i - 1]) + int(s[i]))
+        return ''.join(s)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public String replaceDigits(String s) {
+        char[] chars = s.toCharArray();
+        for (int i = 1; i < chars.length; i += 2) {
+            chars[i] = (char) (chars[i - 1] + (chars[i] - '0'));
+        }
+        return new String(chars);
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1844.Replace All Digits with Characters/README_EN.md

@@ -47,21 +47,33 @@
 	<li><code>shift(s[i-1], s[i]) &lt;= &#39;z&#39;</code> for all <strong>odd</strong> indices <code>i</code>.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def replaceDigits(self, s: str) -> str:
+        s = list(s)
+        for i in range(1, len(s), 2):
+            s[i] = chr(ord(s[i - 1]) + int(s[i]))
+        return ''.join(s)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public String replaceDigits(String s) {
+        char[] chars = s.toCharArray();
+        for (int i = 1; i < chars.length; i += 2) {
+            chars[i] = (char) (chars[i - 1] + (chars[i] - '0'));
+        }
+        return new String(chars);
+    }
+}
 ```
 
 ### **...**

solution/1800-1899/1844.Replace All Digits with Characters/Solution.java

@@ -0,0 +1,9 @@
+class Solution {
+    public String replaceDigits(String s) {
+        char[] chars = s.toCharArray();
+        for (int i = 1; i < chars.length; i += 2) {
+            chars[i] = (char) (chars[i - 1] + (chars[i] - '0'));
+        }
+        return new String(chars);
+    }
+}

solution/1800-1899/1844.Replace All Digits with Characters/Solution.py

@@ -0,0 +1,6 @@
+class Solution:
+    def replaceDigits(self, s: str) -> str:
+        s = list(s)
+        for i in range(1, len(s), 2):
+            s[i] = chr(ord(s[i - 1]) + int(s[i]))
+        return ''.join(s)