编写用于查找int中最频繁的数字的Java方法

import java.util.HashMap;
import java.util.Map;

public class Main {
    public static int findMostFrequentNumber(int[] nums) {
        Map<Integer, Integer> frequencyMap = new HashMap<>();

        for (int num : nums) {
            if (frequencyMap.containsKey(num)) {
                frequencyMap.put(num, frequencyMap.get(num) + 1);
            } else {
                frequencyMap.put(num, 1);
            }
        }

        int mostFrequentNumber = 0;
        int maxFrequency = 0;

        for (Map.Entry<Integer, Integer> entry : frequencyMap.entrySet()) {
            int num = entry.getKey();
            int frequency = entry.getValue();

            if (frequency > maxFrequency) {
                mostFrequentNumber = num;
                maxFrequency = frequency;
            }
        }

        return mostFrequentNumber;
    }

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4, 5, 2, 2, 3, 3, 3};
        int mostFrequentNumber = findMostFrequentNumber(nums);
        System.out.println("Most frequent number: " + mostFrequentNumber);
    }
}