diff options
-rw-r--r-- | max_sum_pair_equal_digits.c | 32 | ||||
-rw-r--r-- | max_sum_pair_equal_digits.py | 30 |
2 files changed, 62 insertions, 0 deletions
diff --git a/max_sum_pair_equal_digits.c b/max_sum_pair_equal_digits.c new file mode 100644 index 0000000..ecf2bcf --- /dev/null +++ b/max_sum_pair_equal_digits.c @@ -0,0 +1,32 @@ +// 2342. Max Sum of a Pair With Equal Sum of Digits +#include "leetcode.h" + +/* + * you are given a 0-indexed array 'nums' consisting of positive integers. you + * can choose two indices 'i' and 'j', such that 'i != j', and the sum of the + * digits of the number 'nums[i]' is equal to that of 'nums[j]'. return the + * maximum value of 'nums[i] + nums[j]' that you can obtain over all + * possible indices 'i' and 'j' that satisfy the conditions. + */ + +int maximumSum(int *nums, int numsSize) { + int map[82], ans = -1; + memset(map, -1, sizeof(map)); + for (int i = 0; i < numsSize; i++) { + int sum = 0, tmap = nums[i]; + while (tmap) { + sum += tmap % 10; + tmap /= 10; + } + if (map[sum] != -1) + ans = fmax(ans, nums[i] + map[sum]); + map[sum] = fmax(map[sum], nums[i]); + } + return ans; +} + +int main() { + int n1[] = {18, 43, 36, 13, 7}, n2[] = {10, 12, 19, 14}; + printf("%d\n", maximumSum(n1, ARRAY_SIZE(n1))); // expect: 54 + printf("%d\n", maximumSum(n2, ARRAY_SIZE(n2))); // expect: -1 +} diff --git a/max_sum_pair_equal_digits.py b/max_sum_pair_equal_digits.py new file mode 100644 index 0000000..dbc9449 --- /dev/null +++ b/max_sum_pair_equal_digits.py @@ -0,0 +1,30 @@ +# 2342. Max Sum of a Pair With Equal Sum of Digits + +""" +you are given a 0-indexed array 'nums' consisting of positive integers. you +can choose two indices 'i' and 'j', such that 'i != j', and the sum of the +digits of the number 'nums[i]' is equal to that of 'nums[j]'. return the +maximum value of 'nums[i] + nums[j]' that you can obtain over all +possible indices 'i' and 'j' that satisfy the conditions. +""" + + +class Solution(object): + def maximumSum(self, nums): + """ + :type nums: List[int] + :rtype: int + """ + map, ans = [-1] * 82, -1 + for i in nums: + digit_sum = sum(int(j) for j in str(i)) + if map[digit_sum] != -1: + ans = max(ans, i + map[digit_sum]) + map[digit_sum] = max(map[digit_sum], i) + return ans + + +if __name__ == "__main__": + obj = Solution() + print(obj.maximumSum(nums=[18, 43, 36, 13, 7])) + print(obj.maximumSum(nums=[10, 12, 19, 14])) |