Java在HashSet中找到最常见的值

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class MostCommonElementInHashSet {
    public static void main(String[] args) {
        HashSet<String> set = new HashSet<>();
        set.add("apple");
        set.add("banana");
        set.add("apple");
        set.add("orange");
        set.add("banana");
        set.add("apple");

        String mostCommonElement = findMostCommonElement(set);
        System.out.println("Most common element: " + mostCommonElement);
    }

    public static String findMostCommonElement(HashSet<String> set) {
        Map<String, Integer> elementCountMap = new HashMap<>();

        for (String element : set) {
            if (elementCountMap.containsKey(element)) {
                elementCountMap.put(element, elementCountMap.get(element) + 1);
            } else {
                elementCountMap.put(element, 1);
            }
        }

        String mostCommonElement = null;
        int maxCount = 0;

        for (Map.Entry<String, Integer> entry : elementCountMap.entrySet()) {
            if (entry.getValue() > maxCount) {
                maxCount = entry.getValue();
                mostCommonElement = entry.getKey();
            }
        }

        return mostCommonElement;
    }
}