Advertisement
2799. Count Complete Subarrays in an Array
MediumView on LeetCode
2799.cs
C#
public class Solution
{
public int CountCompleteSubarrays(int[] nums)
{
const int MAX = 2000;
int totalDistinct = nums.Distinct().Count();
int ans = 0;
int distinct = 0;
int[] count = new int[MAX + 1];
int l = 0;
foreach (int num in nums)
{
if (++count[num] == 1)
++distinct;
while (distinct == totalDistinct)
{
if (--count[nums[l++]] == 0)
--distinct;
}
ans += l;
}
return ans;
}
}Advertisement
Was this solution helpful?