如何使用hashmap在数组中查找最小模式

import java.util.HashMap;

public class ArrayMinPattern {
    public static int findMinPattern(int[] arr) {
        HashMap<Integer, Integer> map = new HashMap<>();

        // 遍历数组，统计元素出现的次数
        for (int num : arr) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }

        int minPattern = Integer.MAX_VALUE;
        int minPatternKey = 0;

        // 遍历HashMap，找到值最小的键
        for (int key : map.keySet()) {
            int count = map.get(key);
            if (count < minPattern) {
                minPattern = count;
                minPatternKey = key;
            }
        }

        return minPatternKey;
    }

    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 2, 1, 3, 1, 2, 3, 3};
        int minPattern = findMinPattern(arr);
        System.out.println("最小模式为：" + minPattern);
    }
}