leetcode 992. Subarrays with K Different Integers

Given an array A of positive integers, call a (contiguous, not necessarily distinct) subarray of A good if the number of different integers in that subarray is exactly K.

(For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3.)

Return the number of good subarrays of A.

 

Example 1:

Input: A = [1,2,1,2,3], K = 2
Output: 7
Explanation: Subarrays formed with exactly 2 different integers: [1,2], [2,1], [1,2], [2,3], [1,2,1], [2,1,2], [1,2,1,2].

Example 2:

Input: A = [1,2,1,3,4], K = 3
Output: 3
Explanation: Subarrays formed with exactly 3 different integers: [1,2,1,3], [2,1,3], [1,3,4].

 

Note:

1. 1 <= A.length <= 20000
2. 1 <= A[i] <= A.length
3. 1 <= K <= A.length

解题思路：

class Solution {
public:
    int subarraysWithKDistinct(vector<int>& A, int K) 
    {
        if(A.empty() || K == 0) return 0 ;
        
        int i = 0 , i_k = 0 , i_k1 = 0 , res = 0;
        unordered_map<int , int> num_cntk , num_cntk1 ;
        num_cntk[A[i_k]]++;
        num_cntk1[A[i_k1]]++ ;
        while(i < A.size())
        {
            
            while(i_k < A.size() && num_cntk.size() < K) 
            {
                i_k++;
                if(i_k < A.size()) num_cntk[A[i_k]]++ ;
            }
            
            while(i_k1 < A.size() && num_cntk1.size() < K + 1)
            {
                i_k1++;
                if(i_k1 < A.size()) num_cntk1[A[i_k1]]++ ;
            }
            res += i_k1 - i_k ;
            num_cntk[A[i]]-- ;
            if(num_cntk[A[i]] == 0) num_cntk.erase(A[i]) ;
            num_cntk1[A[i]]-- ;
            if(num_cntk1[A[i]] == 0) num_cntk1.erase(A[i]) ;
            i++ ;
        }
        
        return res ;
    }
};