You are given an integer array cards where cards[i] represents the value of the ith card. A pair of cards are matching if the cards have the same value.
Return the minimum number of consecutive cards you have to pick up to have a pair of matching cards among the picked cards. If it is impossible to have matching cards, return -1.
Example 1:
Input: cards = [3,4,2,3,4,7] Output: 4 Explanation: We can pick up the cards [3,4,2,3] which contain a matching pair of cards with value 3. Note that picking up the cards [4,2,3,4] is also optimal.
Example 2:
Input: cards = [1,0,5,3] Output: -1 Explanation: There is no way to pick up a set of consecutive cards that contain a pair of matching cards.
Constraints:
1 <= cards.length <= 1050 <= cards[i] <= 106class Solution {
public:
int minimumCardPickup(vector<int>& cards) {
map <int, int> m;
pair<int, int> minima ={-1, INT_MAX};
for(int i=0; i<cards.size(); i++){
if(m[cards[i]]){
if(minima.second>i-m[cards[i]]+1)
minima = {cards[i], i-m[cards[i]]+1};
}
m[cards[i]]=i+1;
}
return minima.second==INT_MAX?-1:minima.second+1;
}
};class Solution {
public int minimumCardPickup(int[] cards) {
int lt = 0, rt = 0, n = cards.length, ans = n + 1;
Map<Integer, Integer> m = new HashMap<>();
for (; rt < n; rt++) {
ans = Math.min(ans, rt - m.getOrDefault(cards[rt], -n) + 1);
m.put(cards[rt], rt);
}
return ans > n ? -1 : ans;
}
}