题解 | 农场牛群众数

import java.util.*;


public class Solution {
    public int[] findMode (int[] nums) {
        final int n = nums.length;
        final int[] result = new int[n];
        final Map<Integer, Integer> map = new HashMap<>();
        int max = 1, maxNum = nums[0];
        for(int i = 0; i < n; ++i) {
            map.merge(nums[i], 1, Integer::sum);
            for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
                final Integer key = entry.getKey();
                final Integer value = entry.getValue();
                if (value > max || (value == max && key > maxNum)) {
                    max = value;
                    maxNum = key;
                }
            }
            result[i] = maxNum;
        }
        return result;
    }
}