leetcode2260. 必须拿起的最小连续卡牌数（java）

hashmap重拳出击

中等简单题(291场周赛第二题)

class Solution {
    public int minimumCardPickup(int[] cards) {
        int res = (int)1e8;
        Map<Integer,Integer> map = new HashMap<>();
        for(int i = 0; i < cards.length; i ++){
            if(map.containsKey(cards[i])){
                res = Math.min(res, i - map.get(cards[i]) + 1);
            }
            map.put(cards[i], i);
        }
        return res == (int)1e8 ? -1 : res;
    }
}