ProgrammingExercize100321

//hash map 1,2,3,4,4,4 --> 4 -> 3 times
//do 11.03.21

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Set;

public class CW040321 {
    static void getMostFrequentElement(int inputArray[]) {
        HashMap<Integer, Integer> elementCountMap = new HashMap<Integer, Integer>();
        for (int i : inputArray) {
            if (elementCountMap.containsKey(i)) {
                elementCountMap.put(i, elementCountMap.get(i)+1);
            } else {
                elementCountMap.put(i, 1);
            }
        }

        int element = 0;
        int frequency = 1;

        Set<Entry<Integer, Integer>> entrySet = elementCountMap.entrySet();
        for (Entry<Integer, Integer> entry : entrySet) {
            if(entry.getValue() > frequency) {
                element = entry.getKey();
                frequency = entry.getValue();
            }
        }

        if(frequency > 1) {
            System.out.println("Original array : "+Arrays.toString(inputArray));
            System.out.println("The most frequent element : "+element + " ---> " + frequency + " times");
            System.out.println("");
        } else {
            System.out.println("Original array : "+Arrays.toString(inputArray));
            System.out.println("No frequent element. All elements are unique.");
        }
    }

    public static void main(String[] args) {
        getMostFrequentElement(new int[]{4, 5, 8, 7, 4, 7, 6,7});
        getMostFrequentElement(new int[]{1, 2, 7, 5, 3, 6, 0});
    }
}

/*------------------OUTPUT------------------
Original array : [4, 5, 8, 7, 4, 7, 6, 7]
The most frequent element : 7 ---> 3 times

Original array : [1, 2, 7, 5, 3, 6, 0]
No frequent element. All elements are unique.

*/