题解 | 牛的体重统计

import java.util.*;


public class Solution {
    public int findMode (int[] weightsA, int[] weightsB) {
        final int m = weightsA.length, n = weightsB.length;
        int[] combined = new int[m + n];
        System.arraycopy(weightsA, 0, combined, 0, m);
        System.arraycopy(weightsB, 0, combined, m, n);
        Map<Integer, Integer> map = new HashMap<>();
        for (int i : combined) {
            map.merge(i, 1, Integer::sum);
        }
        int maxKey = 0, maxVal = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            final int key = entry.getKey();
            final int val = entry.getValue();
            if (val > maxVal || (val == maxVal && key > maxKey)) {
                maxKey = key;
                maxVal = val;
            }
        }
        return maxKey;
    }
}