HTMLify
LeetCode - Max Sum of a Pair With Equal Sum of Digits - Python
Views: 338 | Author: abh
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 | class Solution: def digit_sum(self, num) -> int: s = 0 for d in str(num): s += int(d) return s def maximumSum(self, nums) -> int: h = -1 nums = sorted(nums, reverse=True) for i in range(len(nums)): for j in range(i+1, len(nums)): i_n = nums[i] j_n = nums[j] if i_n + j_n < h: break i_s = self.digit_sum(nums[i]) j_s = self.digit_sum(nums[j]) if i_s != j_s: continue s = i_n + j_n if s > h: h = s return h |