feat: add solutions to lc problem: No.1837

No.1837.Sum of Digits in Base K

Author: YangFong

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

@@ -126,6 +126,47 @@ var sumBase = function (n, k) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function sumBase(n: number, k: number): number {
+    let ans = 0;
+    while (n) {
+        ans += n % k;
+        n = Math.floor(n / k);
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sum_base(mut n: i32, k: i32) -> i32 {
+        let mut ans = 0;
+        while n != 0 {
+            ans += n % k;
+            n /= k;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+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/README_EN.md

@@ -110,6 +110,47 @@ var sumBase = function (n, k) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function sumBase(n: number, k: number): number {
+    let ans = 0;
+    while (n) {
+        ans += n % k;
+        n = Math.floor(n / k);
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn sum_base(mut n: i32, k: i32) -> i32 {
+        let mut ans = 0;
+        while n != 0 {
+            ans += n % k;
+            n /= k;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+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.c

@@ -0,0 +1,8 @@
+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.rs

@@ -0,0 +1,10 @@
+impl Solution {
+    pub fn sum_base(mut n: i32, k: i32) -> i32 {
+        let mut ans = 0;
+        while n != 0 {
+            ans += n % k;
+            n /= k;
+        }
+        ans
+    }
+}

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

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