-
Notifications
You must be signed in to change notification settings - Fork 0
/
2535. Difference Between Element Sum and Digit Sum of an Array
66 lines (50 loc) · 1.68 KB
/
2535. Difference Between Element Sum and Digit Sum of an Array
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/***************************************************
You are given a positive integer array nums.
The element sum is the sum of all the elements in nums.
The digit sum is the sum of all the digits (not necessarily distinct) that appear in nums.
Return the absolute difference between the element sum and digit sum of nums.
Note that the absolute difference between two integers x and y is defined as |x - y|.
Example 1:
Input: nums = [1,15,6,3]
Output: 9
Explanation:
The element sum of nums is 1 + 15 + 6 + 3 = 25.
The digit sum of nums is 1 + 1 + 5 + 6 + 3 = 16.
The absolute difference between the element sum and digit sum is |25 - 16| = 9.
Example 2:
Input: nums = [1,2,3,4]
Output: 0
Explanation:
The element sum of nums is 1 + 2 + 3 + 4 = 10.
The digit sum of nums is 1 + 2 + 3 + 4 = 10.
The absolute difference between the element sum and digit sum is |10 - 10| = 0.
Constraints:
1 <= nums.length <= 2000
1 <= nums[i] <= 2000
Accepted
34.9K
Submissions
39.7K
Acceptance Rate
87.8%
************************************************
class Solution {
public:
int differenceOfSum(vector<int>& nums) {
int total_sum = 0;
int total_digit_sum = 0;
for(int i = 0; i < nums.size(); i++) {
// Store all the array elements sum
total_sum += nums[i];
int n = nums[i], digit_sum = 0;
// Store the digit sums of each elemenet of array
while(n) {
digit_sum += n % 10;
n /= 10;
}
total_digit_sum += digit_sum;
}
// Get the diff between total sum total digit sum
return abs(total_digit_sum - total_sum);
}
};