力扣周赛-302：6164. 数位和相等数对的最大和

class Solution {
    public int maximumSum(int[] nums) {
        List<PriorityQueue<Integer>> temp = new ArrayList<>();
        for (int i = 0; i < 1000; i++){
            temp.add(new PriorityQueue<>((o1, o2) -> o2 - o1));
        }
        for (int i : nums){
            int calculation = calculation(i);
            temp.get(calculation).add(i);
        }
        int res = -1;
        for (PriorityQueue<Integer> queue : temp) {
            if (queue.size() > 1){
                res = Math.max(res, queue.poll() + queue.poll());
            }
        }
        return res;
    }
    
    private int calculation(int num){
        int res = 0;
        while (num != 0){
            res += num % 10;
            num /= 10;
        }
   
        return res;
    }
}