feat: add solutions to lc problem: No.1837

No.1837.Sum of Digits in Base K

Author: yanglbme

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

@@ -41,7 +41,11 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
-将 n 除 k 取余，直至为 0，余数相加求得结果。
+**方法一：数学**
+
+我们将 $n$ 除 $k$ 取余，直至为 $0$，余数相加即可得到结果。
+
+时间复杂度 $O(\log_{k}n)$，空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
 
@@ -52,11 +56,11 @@
 ```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
+        ans = 0
+        while n:
+            ans += n % k
+            n //= k
+        return ans
 ```
 
 ### **Java**
@@ -66,16 +70,62 @@ class Solution:
 ```java
 class Solution {
     public int sumBase(int n, int k) {
-        int res = 0;
+        int ans = 0;
         while (n != 0) {
-            res += (n % k);
+            ans += n % k;
+            n /= k;
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int sumBase(int n, int k) {
+        int ans = 0;
+        while (n) {
+            ans += n % k;
             n /= k;
         }
-        return res;
+        return ans;
     }
+};
+```
+
+### **Go**
+
+```go
+func sumBase(n int, k int) (ans int) {
+	for n > 0 {
+		ans += n % k
+		n /= k
+	}
+	return
 }
 ```
 
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n
+ * @param {number} k
+ * @return {number}
+ */
+var sumBase = function (n, k) {
+    let ans = 0;
+    while (n) {
+        ans += n % k;
+        n = Math.floor(n / k);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

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

@@ -42,28 +42,74 @@
 ```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
+        ans = 0
+        while n:
+            ans += n % k
+            n //= k
+        return ans
 ```
 
 ### **Java**
 
 ```java
 class Solution {
     public int sumBase(int n, int k) {
-        int res = 0;
+        int ans = 0;
         while (n != 0) {
-            res += (n % k);
+            ans += n % k;
             n /= k;
         }
-        return res;
+        return ans;
     }
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int sumBase(int n, int k) {
+        int ans = 0;
+        while (n) {
+            ans += n % k;
+            n /= k;
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func sumBase(n int, k int) (ans int) {
+	for n > 0 {
+		ans += n % k
+		n /= k
+	}
+	return
+}
+```
+
+### **JavaScript**
+
+```js
+/**
+ * @param {number} n
+ * @param {number} k
+ * @return {number}
+ */
+var sumBase = function (n, k) {
+    let ans = 0;
+    while (n) {
+        ans += n % k;
+        n = Math.floor(n / k);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int sumBase(int n, int k) {
+        int ans = 0;
+        while (n) {
+            ans += n % k;
+            n /= k;
+        }
+        return ans;
+    }
+};

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

@@ -0,0 +1,7 @@
+func sumBase(n int, k int) (ans int) {
+	for n > 0 {
+		ans += n % k
+		n /= k
+	}
+	return
+}

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

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

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

@@ -0,0 +1,13 @@
+/**
+ * @param {number} n
+ * @param {number} k
+ * @return {number}
+ */
+var sumBase = function (n, k) {
+    let ans = 0;
+    while (n) {
+        ans += n % k;
+        n = Math.floor(n / k);
+    }
+    return ans;
+};

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

@@ -1,7 +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
+        ans = 0
+        while n:
+            ans += n % k
+            n //= k
+        return ans