feat: add solutions to lc problem: No.2535

No.2535.Difference Between Element Sum and Digit Sum of an Array

Author: YangFong

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README.md

@@ -136,6 +136,56 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function differenceOfSum(nums: number[]): number {
+    return nums.reduce((r, v) => {
+        r += v;
+        while (v !== 0) {
+            r -= v % 10;
+            v = Math.floor(v / 10);
+        }
+        return r;
+    }, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn difference_of_sum(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for &num in nums.iter() {
+            let mut num = num;
+            ans += num;
+            while num != 0 {
+                ans -= num % 10;
+                num /= 10;
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int differenceOfSum(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += nums[i];
+        while (nums[i]) {
+            ans -= nums[i] % 10;
+            nums[i] /= 10;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/README_EN.md

@@ -120,6 +120,56 @@ func abs(x int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function differenceOfSum(nums: number[]): number {
+    return nums.reduce((r, v) => {
+        r += v;
+        while (v !== 0) {
+            r -= v % 10;
+            v = Math.floor(v / 10);
+        }
+        return r;
+    }, 0);
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn difference_of_sum(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for &num in nums.iter() {
+            let mut num = num;
+            ans += num;
+            while num != 0 {
+                ans -= num % 10;
+                num /= 10;
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int differenceOfSum(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += nums[i];
+        while (nums[i]) {
+            ans -= nums[i] % 10;
+            nums[i] /= 10;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/Solution.c

@@ -0,0 +1,11 @@
+int differenceOfSum(int *nums, int numsSize) {
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += nums[i];
+        while (nums[i]) {
+            ans -= nums[i] % 10;
+            nums[i] /= 10;
+        }
+    }
+    return ans;
+}

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/Solution.rs

@@ -0,0 +1,14 @@
+impl Solution {
+    pub fn difference_of_sum(nums: Vec<i32>) -> i32 {
+        let mut ans = 0;
+        for &num in nums.iter() {
+            let mut num = num;
+            ans += num;
+            while num != 0 {
+                ans -= num % 10;
+                num /= 10;
+            }
+        }
+        ans 
+    }
+}

solution/2500-2599/2535.Difference Between Element Sum and Digit Sum of an Array/Solution.ts

@@ -0,0 +1,10 @@
+function differenceOfSum(nums: number[]): number {
+    return nums.reduce((r, v) => {
+        r += v;
+        while (v !== 0) {
+            r -= v % 10;
+            v = Math.floor(v / 10);
+        }
+        return r;
+    }, 0);
+}