leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

2342.cpp (575B)

0 class Solution { 1 static int sum_digits(int n) { 2 int res = 0; 3 while (n) 4 res += n % 10, n /= 10; 5 return res; 6 } 7 8 public: 9 int maximumSum(const vector<int> &nums) const { 10 static int um[82]; 11 int res = -1; 12 13 memset(um, 0x00, sizeof(um)); 14 for (const int num : nums) { 15 const int sum = sum_digits(num); 16 if (um[sum]) 17 res = max(res, num + um[sum]), um[sum] = max(um[sum], num); 18 else 19 um[sum] = num; 20 } 21 22 return res; 23 } 24 };