Find the number with the most occurrences in the array

Use HashMap, Every Entry Of key Store the numbers in the array ,value Store the number of occurrences of this number , First, traverse the array element construction HashMap, And then I'm going to go through each one Entry, Find out the maximum value Corresponding key, That is, the number with the most occurrences . The time complexity of this algorithm is O(n).Java The code is as follows

public class SearchMuch {

    public static void candidate (int[] array)    //  Find the number that appears the most in the array 
    {
        // map Of key Store the numbers in the array ,value Store the number of occurrences of this number 
        HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
        for(int i = 0; i < array.length; i++)
        {
            if(map.containsKey(array[i]))        
            {
                int formerValue = map.get(array[i]);
                map.put(array[i], formerValue + 1);    //  The number of times this number appears plus 1
            }
            else
            {
                map.put(array[i], 1);    //  This number appears for the first time 
            }
        }
        Collection<Integer> count = map.values();
        //  find map Of value The maximum , That is, the number of times that the most numbers appear in the array 
        int maxCount = Collections.max(count);
        int maxNumber = 0;
        for(Map.Entry<Integer, Integer> entry : map.entrySet())
        {
            // obtain value by maxCount Of key, That is, the number that appears the most times in the array 
            if(entry.getValue() == maxCount)
            {
                maxNumber = entry.getKey();
            }
        }
        System.out.println(" The number with the most occurrences is ：" + maxNumber);
        System.out.println(" The number appears in total " + maxCount + " Time ");
    }
}