| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.CountCompleteSubarraysInAnArray; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CountCompleteSubarraysInAnArrayFrequencyArray : ICountCompleteSubarraysInAnArray |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="nums"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int CountCompleteSubarrays(int[] nums) |
| | 2 | 24 | | { |
| | 2 | 25 | | var distinctCount = 0; |
| | 2 | 26 | | var distinctArray = new bool[2000]; |
| | | 27 | | |
| | 24 | 28 | | foreach (var num in nums) |
| | 9 | 29 | | { |
| | 9 | 30 | | if (distinctArray[num - 1]) |
| | 5 | 31 | | { |
| | 5 | 32 | | continue; |
| | | 33 | | } |
| | | 34 | | |
| | 4 | 35 | | distinctArray[num - 1] = true; |
| | | 36 | | |
| | 4 | 37 | | distinctCount++; |
| | 4 | 38 | | } |
| | | 39 | | |
| | 2 | 40 | | var count = 0; |
| | | 41 | | |
| | 2 | 42 | | var frequencyArray = new int[2000]; |
| | | 43 | | |
| | 2 | 44 | | var left = 0; |
| | 2 | 45 | | var currentDistinctCount = 0; |
| | | 46 | | |
| | 22 | 47 | | for (var right = 0; right < nums.Length; right++) |
| | 9 | 48 | | { |
| | 9 | 49 | | var rightValue = nums[right] - 1; |
| | | 50 | | |
| | 9 | 51 | | if (frequencyArray[rightValue] == 0) |
| | 7 | 52 | | { |
| | 7 | 53 | | currentDistinctCount++; |
| | 7 | 54 | | } |
| | | 55 | | |
| | 9 | 56 | | frequencyArray[rightValue]++; |
| | | 57 | | |
| | 15 | 58 | | while (currentDistinctCount == distinctCount) |
| | 6 | 59 | | { |
| | 6 | 60 | | count += nums.Length - right; |
| | | 61 | | |
| | 6 | 62 | | frequencyArray[nums[left] - 1]--; |
| | | 63 | | |
| | 6 | 64 | | if (frequencyArray[nums[left] - 1] == 0) |
| | 5 | 65 | | { |
| | 5 | 66 | | currentDistinctCount--; |
| | 5 | 67 | | } |
| | | 68 | | |
| | 6 | 69 | | left++; |
| | 6 | 70 | | } |
| | 9 | 71 | | } |
| | | 72 | | |
| | 2 | 73 | | return count; |
| | 2 | 74 | | } |
| | | 75 | | } |