| | | 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.DivideArrayInSetsOfKConsecutiveNumbers; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class DivideArrayInSetsOfKConsecutiveNumbersDictionary : IDivideArrayInSetsOfKConsecutiveNumbers |
| | | 16 | | { |
| | | 17 | | public bool IsPossibleDivide(int[] nums, int k) |
| | 15 | 18 | | { |
| | 15 | 19 | | if (nums.Length % k != 0) |
| | 3 | 20 | | { |
| | 3 | 21 | | return false; |
| | | 22 | | } |
| | | 23 | | |
| | 12 | 24 | | Array.Sort(nums); |
| | | 25 | | |
| | 12 | 26 | | var numsDictionary = new Dictionary<int, int>(); |
| | | 27 | | |
| | 168 | 28 | | foreach (var num in nums) |
| | 66 | 29 | | { |
| | 66 | 30 | | if (!numsDictionary.TryAdd(num, 1)) |
| | 10 | 31 | | { |
| | 10 | 32 | | numsDictionary[num]++; |
| | 10 | 33 | | } |
| | 66 | 34 | | } |
| | | 35 | | |
| | 33 | 36 | | while (numsDictionary.Count > 0) |
| | 23 | 37 | | { |
| | 23 | 38 | | var firstNum = numsDictionary.First().Key; |
| | | 39 | | |
| | 168 | 40 | | for (var i = 0; i < k; i++) |
| | 63 | 41 | | { |
| | 63 | 42 | | var currentNum = firstNum + i; |
| | | 43 | | |
| | 63 | 44 | | if (numsDictionary.TryGetValue(currentNum, out var value)) |
| | 61 | 45 | | { |
| | 61 | 46 | | if (value == 1) |
| | 53 | 47 | | { |
| | 53 | 48 | | numsDictionary.Remove(currentNum); |
| | 53 | 49 | | } |
| | | 50 | | else |
| | 8 | 51 | | { |
| | 8 | 52 | | numsDictionary[currentNum] = value - 1; |
| | 8 | 53 | | } |
| | 61 | 54 | | } |
| | | 55 | | else |
| | 2 | 56 | | { |
| | 2 | 57 | | return false; |
| | | 58 | | } |
| | 61 | 59 | | } |
| | 21 | 60 | | } |
| | | 61 | | |
| | 10 | 62 | | return true; |
| | 15 | 63 | | } |
| | | 64 | | } |