1
class Solution {
2
  public String largestWordCount(String[] messages, String[] senders) {
3
    HashMap<String, Integer> map = new HashMap<>();
4
    String res = "";
5
    int max = 0;
6

7
    for (int i = 0; i < messages.length; i++) {
8
      int words = get_count(messages[i]);
9

10
      if (!map.containsKey(senders[i])) map.put(senders[i], words);
11
      else map.put(senders[i], map.get(senders[i]) + words);
12
    }
13

14
    for (String s : map.keySet()) {
15
      if (map.get(s) > max) {
16
        res = s;
17
        max = map.get(s);
18
      }
19

20
      if (map.get(s) == max && res.compareTo(s) < 0) res = s;
21
    }
22
    return res;
23
  }
24

25
  private int get_count(String s) {
26
    int spaces = 0;
27

28
    for (int i = 0; i < s.length(); i++) {
29
      char ch = s.charAt(i);
30
      if (ch == ' ') spaces++;
31
    }
32
    return spaces + 1;
33
  }
34
}