Clean Java Priority Queue Solution
\nclass Solution {\n    public String largestWordCount(String[] messages, String[] senders) {\n        HashMap<String, Integer> map = new HashMap<>();\n        
```\nclass Solution {\n    public String largestWordCount(String[] messages, String[] senders) {\n        HashMap<String, Integer> map = new HashMap<>();\n        int max = 0;\n        for(int i = 0; i < senders.length; i++) {\n            int size = messages[i].split(" ").length;\n            map.put(senders[i], map.getOrDefault(senders[i], 0) + size);\n            max = Math.max(max, map.get(senders[i]));\n        }\n        \n        PriorityQueue<String> pq = new PriorityQueue<>(Collections.reverseOrder());\n        for(String key : map.keySet()) {\n            if(map.get(key) == max) {\n                pq.add(key);\n            }\n        }\n        return pq.poll();\n    }\n}\n```
[]