Max Sum of a Pair With Equal Sum of Digits LeetCode solution in Java

1
class Solution {
2
  public int maximumSum(int[] nums) {
3
    HashMap<Integer, Integer> map = new HashMap<>();
4
    int result = -1;
5

6
    for (int item : nums) {
7
      int key = getNumberTotal(item);
8

9
      if (!map.containsKey(key)) map.put(key, item);
10
      else {
11
        result = Math.max(result, map.get(key) + item);
12
        map.put(key, Math.max(map.get(key), item));
13
      }
14
    }
15

16
    return result;
17
  }
18

19
  int getNumberTotal(int num) {
20
    int result = 0;
21
    while (num > 0) {
22
      result += num % 10;
23
      num /= 10;
24
    }
25

26
    return result;
27
  }
28
}